Existence of common graphs with large chromatic number
Jan Volec, 4 Oct 2021
Ramsey’s Theorem states that for every graph
A classical result of Goodman from 1959 states that triangle is a common graph. On the
other hand, Thomason proved in 1989 that no clique of order at least four is common,
and existence of a common graph with chromatic number larger than three was open
until about 10 years ago, when Hatami, Hladky, Kral, Norin and Razborov proved that
the 5-wheel is common. In this talk, we show that for every
This is a joint work with D. Kral, J. Noel, S. Norin, and F. Wei