This course covers the topics of descriptive combinatorics and distributed algorithms. The learning outcomes include understanding coloring infinite graphs, shift graphs, paths, extended Brooks- Converse, continuous colorings, and measurable colorings. The course teaches skills in applying distributed algorithms to descriptive results. The teaching method involves presenting examples, discussing results, and exploring applications. The intended audience for this course is individuals interested in mathematics, combinatorics, and algorithms.
Overview
Syllabus
Intro
Coloring infinite graphs
Example: the shift graph
Descriptive combinatories
A sample of results
Example: paths
From distributed algorithms to descriptive results
Application I: extended Brooks
Converse?
Continuous colorings and deterministic algorithms
Measurable colorings and randomized algorithms?
Taught by
Joint Mathematics Meetings
