SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Combinatorics - NMAG403
Title in English: Kombinatorika
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2017 to 2019
Semester: winter
E-Credits: 5
Hours per week, examination: winter s.:2/2 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: English, Czech
Teaching methods: full-time
Guarantor: prof. RNDr. Jan Kratochvíl, CSc.
Class: M Mgr. MSTR
M Mgr. MSTR > Povinné
Classification: Mathematics > Algebra
Annotation -
Last update: doc. Mgr. Milan Hladík, Ph.D. (01.04.2015)
Basic topics of graph theory and regular combinatorial structures.
Course completion requirements -
Last update: prof. RNDr. Jan Kratochvíl, CSc. (12.10.2017)

Credit for recitations is given after obtaining at least 50% points from home assignments (typically 3 sets of problems per semester). There is no alternative way nor second try.

Literature -
Last update: T_KA (14.05.2013)

Matoušek, J., Nešetřil, J.: Kapitoly z diskrétní matematiky, Karolinum, Praha, 2002

Diestel, R.: Graph Theory, Graduate Texts in Mathematics, Volume 173, Springer Verlag, Fourth Edition 2010

Hall, M. Jr.: Combinatorial Theory, Wiley, New York, 1986

Bollobás, B.: Modern Graph Thoery, Graduate Texts in Mathematics, Springer Verlag, 1998

Requirements to the exam -
Last update: prof. RNDr. Jan Kratochvíl, CSc. (18.10.2018)

The exam is oral. The knowledge and skills examined correspond to the syllabus in extent presented during the lectures. Common understanding to all notions and their relationship, theorems including proofs and ability to apply the acquired skills to simple situations related to the topics of the class are subject of the examination. Credit from the recitations must be obtained prior to enrolling to an exam.

Syllabus -
Last update: doc. Mgr. Milan Hladík, Ph.D. (01.04.2015)

Generating functions and combinatorial enumeration.

Extremal graph theory.

Ramsey theory.

Network flows and graph connectivity measures.

Structural aspects of set systems and transversals.

Embedding of graphs to surfaces of higher genus and their chromatic numbers.

Regular combinatorial structures, existence.

Finite projective planes.

Balanced incomplete block designs.

Steiner triple systems.

Symmetric designs, Bruck-Ryser-Chowla theorem.

Hadamard matrices.

Mutually ortogonal Latin squares.

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html