SubjectsSubjects(version: 964)
Course, academic year 2024/2025
   Login via CAS
Combinatorics and Graph Theory 1 - NDMI011
Title: Kombinatorika a grafy 1
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2023
Semester: winter
E-Credits: 5
Hours per week, examination: winter s.:2/2, C+Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: taught
Language: Czech, English
Teaching methods: full-time
Guarantor: doc. RNDr. Vít Jelínek, Ph.D.
doc. RNDr. Jiří Fiala, Ph.D.
Teacher(s): doc. RNDr. Martin Balko, Ph.D.
doc. RNDr. Vít Jelínek, Ph.D.
Bc. Jiří Kalvoda
Bc. Václav Lepič
Mgr. David Mikšaník
Bc. Josef Tkadlec, Ph.D.
Hadi Zamani, M.Sc.
Class: Informatika Bc.
Classification: Informatics > Discrete Mathematics
Incompatibility : NDMA001, NDMX011
Interchangeability : NDMX011
Is incompatible with: NDMI031, NDMX011
Is pre-requisite for: NDMI069, NDMI021, NDMI068, NPFL049
Is interchangeable with: NDMA001, NDMI031, NDMX011
Annotation -
Inclusion-exclusion principle and its applications. Generating functions. Finite projective planes, latin squares. Hall theorem and its applications. Flows in digraphs. k-connectivity of graphs. Ramsey theory.
Last update: PANGRAC/MFF.CUNI.CZ (08.04.2010)
Course completion requirements -

Hadi Zamani (Winter 2024/2025): To obtain tutorial credit, students must obtain at least 60/90 points from the HW assignments, or at least 60/100 points from the quizzes (best 2 of 3 quizzes count), or at least 100 points in total. To take the exam, students must first obtain tutorial credit.

Last update: Tkadlec Josef, Bc., Ph.D. (14.10.2024)
Literature -

J. Matoušek, J. Nešetřil: Invitation to Discrete Mathematics, Oxford University Press (1998)

R. Diestel: Graph Theory (4th edition), Springer (2010)

Last update: Jelínek Vít, doc. RNDr., Ph.D. (22.11.2012)
Requirements to the exam -

Josef Tkadlec (Winter 2024/2025): To take the exam, students must first obtain tutorial credit. The exam has a combined form: written and oral. In the written part, you might be required to state a definition/theorem from the lecture; to prove a theorem from the lecture; and/or to solve a problem related to the material covered in the lecture/tutorial.

Last update: Tkadlec Josef, Bc., Ph.D. (14.10.2024)
Syllabus -

Double Counting: Sperner Theorem, The maximum number of edges in a graph without C4 and without K3.

Number of spanning trees (determinant proof) and electrical networks.

Generating functions (understood as Taylor series), applications: Catalan, Fibonacci numbers, solving recurrences, asymptotics of the solution.

Finite projective planes.

Error-correcting codes, basic properties. Hammnig code, Hadamard code. Existence of asymptotically good codes (Gilbert-Varshamov). Hamming's lower bound.

Maximum matching in graphs, Hall's theorem and its applications (Birkhoff-von Neumann theorem), Tutte theorem.

k-connectivity, Menger's theorem. Ear lemma, structure of 2-connected graphs.

Ramsey theorem, Ramsey theorem for p-tuples, Ramsey infinite theorem.

König's theorem on the infinite branch.

Last update: Tkadlec Josef, Bc., Ph.D. (14.10.2024)
 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html