2026 Workshop on Topological Combinatorics
The 2026 Workshop on Topological Combinatorics will be held from June 28 to July 11, 2026 at Gwangju Institute of Science and Technology (GIST), located in Gwangju in the southwest …
10 events found.
Events
-
-
GIST
-
Ting-Wei Chao, The Oddtown Problem Modulo a Composite Number
Room B332 IBS (기초과학연구원)A family of sets in $$ is called an $\ell$-Oddtown if the sizes of all sets are not divisible by $\ell$, but the sizes of pairwise intersections are divisible by …
-
Yaobin Chen, Maximum in-general-position set in a random subset of $\mathbb{F}^d_q$
Room B332 IBS (기초과학연구원)Let $\alpha(\mathbb{F}_q^{d},p)$ be the maximum possible size of a point set in general position in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^{d},p)$ up to …
-
Sang-il Oum (엄상일), A proof of the cycle double cover conjecture by OpenAI
Room B332 IBS (기초과학연구원)The cycle double cover conjecture (CDC) claims that every graph without cut-edges has a list of cycles such that every edge appears exactly twice in the list. This conjecture was …
-
Zichao Dong, $k$-wise odd-even towns
Room B332 IBS (기초과학연구원)For $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_k) \in {\mathbb F}_2^k$, an $\boldsymbol{\alpha} $-town is a set family in which every $i$-wise intersection has parity $\alpha_i$. Denote by $f_{\boldsymbol{\alpha} }(n)$ the maximum …
-
2026 Korean Student Combinatorics Workshop
Gongju Hanok Village, GongjuWebsite: https://kscw.combinatorics.kr/
-
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 …
-
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 …