Tuesday, April 2, 2024 @ 4:30 PM - 5:30 PM KST Casey Tompkins, On graphs without cycles of length 0 modulo 4 Room B332 IBS (기초과학연구원) Bollobás proved that for every k and ℓ such that kZ+ℓ contains an even number, an n-vertex graph containing no cycle of length ℓmodk can contain at most … Continue Reading