Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Seminar on Combinatorial Problems - NDMI052

Title:	Problémový seminář z kombinatoriky
Guaranteed by:	Department of Applied Mathematics (32-KAM)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2018
Semester:	both
E-Credits:	5
Hours per week, examination:	0/3, C [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	English, Czech
Teaching methods:	full-time
Teaching methods:	full-time
Note:	you can enroll for the course repeatedly you can enroll for the course in winter and in summer semester

Guarantor:	prof. RNDr. Jan Kratochvíl, CSc. doc. RNDr. Pavel Valtr, Dr.
Teacher(s):	doc. Mgr. Jan Kynčl, Ph.D. doc. RNDr. Pavel Valtr, Dr.
Class:	Informatika Mgr. - volitelný
Classification:	Informatics > Discrete Mathematics

Opinion survey results Examination dates WS schedule SS schedule Noticeboard

Annotation -

Team work on solving open combinatorial problems. Easily formulated combinatorial problems of medium difficulty are discussed.

Last update: T_KSI (09.05.2001)

Course completion requirements -

The credit can be obtained for an active participation in the seminar. The nature of the conditions do not allow repeated attempts for obtaining the credit.

Last update: Kynčl Jan, doc. Mgr., Ph.D. (04.10.2019)

Literature -

Selected papers specified by the teacher(s) of the seminar.

Last update: Kynčl Jan, doc. Mgr., Ph.D. (04.10.2019)

Syllabus -

See the annotation

Last update: Kynčl Jan, doc. Mgr., Ph.D. (10.05.2018)