Subjects

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

Combinatorial Etudes - NDMI082

Title:	Kombinatorické etudy
Guaranteed by:	Computer Science Institute of Charles University (32-IUUK)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2015 to 2017
Semester:	both
E-Credits:	3
Hours per week, examination:	0/2, C [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	not taught
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time
Additional information:	http://kam.mff.cuni.cz/~samal/vyuka/ke/
Note:	you can enroll for the course repeatedly you can enroll for the course in winter and in summer semester

Guarantor:	doc. Mgr. Robert Šámal, Ph.D.
Class:	Informatika Mgr. - volitelný
Classification:	Informatics > Discrete Mathematics

Opinion survey results Examination dates Schedule Noticeboard

Annotation -

Last update: T_KAM (17.04.2010)

Solving of harder exercises from combinatorics and graph theory. The aim is to use own attempts, perhaps not always successful, to get used to tricks and techniques useful for tackling of open problems.

Literature -

Last update: T_KAM (17.04.2010)

L. Lovász: Combinatorial problems and exercises

Syllabus -

Last update: T_KAM (17.04.2010)

Solving of harder exercises from combinatorics and graph theory.

The aim is to use own attempts, perhaps not always successful, to get used to tricks and techniques useful for tackling of open problems.