August 29 Friday @ 4:30 PM - 5:30 PM KST The Erdős-Pósa property for circle graphs as vertex-minors Room B332 IBS (기초과학연구원) We prove that for any circle graph H with at least one edge and for any positive integer k, there exists an integer t=t(k,H) so that every graph G either … Continue Reading
September 2 Tuesday @ 4:30 PM - 5:30 PM KST Zhifei Yan, A Rainbow version of Lehel’s conjecture Room B332 IBS (기초과학연구원) Lehel's conjecture states that every 2-edge-colouring of the complete graph Kn admits a partition of its vertices into two monochromatic cycles. This was proven for sufficiently large n by Luczak, … Continue Reading