Ramsey Theory - NDMI108

• Title: Ramsey Theory
• Guaranteed by: Department of Applied Mathematics (32-KAM)
• Faculty: Faculty of Mathematics and Physics
• Actual: from 2020
• 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: English
• Teaching methods: full-time
• Teaching methods: full-time
• Guarantor: prof. RNDr. Martin Loebl, CSc.
• Teacher(s): Mykhaylo Tyomkyn, Ph.D.
• Class: DS, diskrétní modely a algoritmy; Informatika Mgr. - Diskrétní modely a algoritmy
• Classification: Informatics > Discrete Mathematics

Annotation

Ramsey theory of graphs, hypergraphs, and on the integers.

Last update: Klimošová Tereza, Mgr., Ph.D. (30.04.2020)

Literature

R. L. Graham, B. L. Rothschild and J. H. Spencer: Ramsey Theory.

Wiley-Interscience; 2 edition (1990) 978-0471500469

Last update: Klimošová Tereza, Mgr., Ph.D. (30.04.2020)

Syllabus

Ramsey's theorem for graphs and hypergraphs, theorems of van der

Waerden and Hales-Jewett. Partition regularity: Rado's theorem.

Connections to topology.

Last update: Klimošová Tereza, Mgr., Ph.D. (30.04.2020)