- This event has passed.
Joonkyung Lee (이준경), On common graphs
Wednesday, December 2, 2020 @ 5:00 PM - 6:00 PM KST
A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is minimised by the random colouring. Burr and Rosta, extending a famous conjecture by Erdős, conjectured that every graph is common. The conjectures by Erdős and by Burr and Rosta were disproved by Thomason and by Sidorenko, respectively, in the late 1980s.
Despite its importance, the full classification of common graphs is still a wide open problem and has not seen much progress since the early 1990s. In this lecture, I will present some old and new techniques to prove whether a graph is common or not.