Tuesday, November 22, 2022 @ 4:30 PM - 5:30 PM KST Seonghyuk Im (임성혁), A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems Room B332 IBS (기초과학연구원) A linear 3-graph is called a (3-)hypertree if there exists exactly one path between each pair of two distinct vertices. A linear 3-graph is called a Steiner triple system if … Continue Reading