Meike Hatzel, Directed tree-cutwidth and immersions
The first major step towards the graph minor structure theorem by Robertson and Seymour was the grid theorem, a result describing that every graph of large treewidth contains a grid …
6 events found.
Events
-
-
Room B332 IBS (기초과학연구원)
-
2026 Summer School on Combinatorics and Algorithms (2026 조합론 및 알고리즘 여름학교)
Bldg. E11, KAISTThe 2026 Summer School on Combinatorics and Algorithms is a venue for students and early-career researchers to learn selected topics in theoretical computer science and discrete mathematics. It will be …
-
Jinyoung Park (박진영), A reformulation of Talagrand’s Discrete Convexity Conjecture
Room B332 IBS (기초과학연구원)The "Convexity Conjecture" by Talagrand asks, roughly speaking, whether one can "create convexity" in a bounded number of steps regardless of the dimension of the ambient space. Talagrand also proposed …
-
-
Ben Lund, TBA
Room B332 IBS (기초과학연구원) -
David Wood, Proof of the Clustered Hadwiger Conjecture
Room B332 IBS (기초과학연구원)Hadwiger famously conjectured that every $K_h$-minor-free graph is properly $(h-1)$-colourable. This talk will present the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with …
-
-
2026 Combinatorics Workshop (2026 조합론 학술대회)
Konjiam Resort, EW Village, B2, Meeting Room OPUS2Combinatorics Workshop (조합론 학술대회) is an annual conference for researchers in combinatorics and related areas in Korea. It was started in 2004 by the Yonsei University BK21 Research Group. Since …