Extremal combinatorics - NDMI113

• Title: Extremal combinatorics
• Guaranteed by: Department of Applied Mathematics (32-KAM)
• Faculty: Faculty of Mathematics and Physics
• Actual: from 2022
• Semester: summer
• E-Credits: 3
• Hours per week, examination: summer s.:2/0, Ex [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
• Guarantor: Mykhaylo Tyomkyn, Ph.D.

Syllabus

Last update: doc. Mgr. Jan Hubička, Ph.D. (28.05.2021)

Sperner's Lemma, LYM inequality, the Littlewood-Offord problem, up- and down-sets, shadows: the Kruskal-Katona theorem, intersecting families: Erdos-Ko-Rado, Ahlswede-Khachatrian. Modular intersections theorems and their applications, the Combinatorial Nullstellensatz.