2026 Korean Student Combinatorics Workshop
Website: https://kscw.combinatorics.kr/
10 events found.
Events
-
-
Gongju Hanok Village, Gongju
-
Stephan Kreutzer, Disjoint Paths in Graphs and Digraphs
Room B332 IBS (기초과학연구원)One of the important algorithmic consequences of Robertson and Seymour's Graph Minor Project is their proof that the k-Vertex-Disjoint Paths problem is fixed-parameter tractable on the class of all undirected …
-
-
Tomohiro Koana, A Single-Exponential FPT Algorithm for 2-Vertex-Connectivity Augmentation
Room B332 IBS (기초과학연구원)We study restricted-link augmentation to 2-vertex-connectivity. An instance consists of a graph $G$, possibly disconnected, a set $L$ of admissible links on its vertices, integer link costs in $\{1, \ldots, …
-
Meike Hatzel, Directed tree-cutwidth and immersions
Room B332 IBS (기초과학연구원)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 …
-
Hyunwoo Lee (이현우), A super-exponential lower bound construction for the multicolor triangle Ramsey problem discovered by OpenAI
Room B332 IBS (기초과학연구원)Let $R_k(3)$ denote the smallest integer $N$ such that every $k$-edge-coloring of the complete graph $K_N$ contains a monochromatic triangle. A simple inductive argument gives the classical factorial upper bound …
-
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, Incidences between points and n-flats in PG(n+d,q)
Room B332 IBS (기초과학연구원)Let $P$ be a set of points in $PG(n+d,q)$, and let $L$ be a set of $n$-flats. Here, $n$-flat is a short name for $n$-dimensional projective subspaces. A classical bound …
-
Olga Medrano Martín del Campo, Epsilon-saturation for Littlestone classes and stable graphs
Room B332 IBS (기초과학연구원)We introduce the concept of the saturation of a (bi)graph: the union closure after inductively adding its virtual elements, which are weighted ε-good (respectively ε-excellent sets) as in the Stable …
-
Gabriëlle Zwaneveld, On Seymour-tight orientations
Room B332 IBS (기초과학연구원)I discuss 'almost counterexamples' to Seymour's second neighbourhood conjecture. In what we call Seymour-tight orientations, the size of the first neighbourhood of each vertex equals the size of its second …