Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Online/Virtual, Eisenbud Auditorium |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
Unavoidable subgraphs in Ramsey graphs
The recent girth Ramsey theorem of Reiher and Rödl yields the local structures in Ramsey graphs and this paralleles the work of Erdős for high chromatic graphs. In this talk we discuss some ideas of the proof. In particular, we construct high chromatic graphs with high girth based on the partite construction method and explain how this method, which was pioneered by Nešetřil and Rödl, can be adapted for partitions of the edge set. If time allows we discuss some consequences of the girth Ramsey theorem obtained in joint work with Reiher and Rödl.
No Notes/Supplements Uploaded