Benjamin Duhamel, Excluding a forest induced minor
We give an induced counterpart of the Forest Minor theorem: for any t ≥ 2, the $K_{t,t}$-subgraph-free H-induced-minor-free graphs have bounded pathwidth if and only if H belongs to a …
10 events found.
Events
-
-
Room B332 IBS (기초과학연구원)
-
Xavier Goaoc, A canonical tree decomposition for order types, and some applications
Room B332 IBS (기초과학연구원)We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept …
-
Fernanda Rivera Omaña, Erdős-Pósa theorem for matroids
Room B332 IBS (기초과학연구원)We will look at an analogue theorem of the classical Erdős-Pósa Theorem. We prove a $GF(q)$-representable matroid analogue of Robertson and Seymour's theorem that planar graphs have an Erdős-Pósa property. …
-
-
Maria Chudnovsky, Induced minors and treewidth
Room B332 IBS (기초과학연구원)This talk deals with induced minor obstructions to treewidth. The natural setup for this problem is to consider the class of graphs excluding some planar graph, and some complete bipartite …
-
J. Pascal Gollin, Dominated balanced separators in wheel-induced-minor-free graphs
Room B332 IBS (기초과학연구원)The grid theorem of Robertson and Seymour can be equivalently stated using balanced separators, that are separators whose deletion leaves every component with no more than half of the vertices …
-
Harry Richman, Distinguishing graphs with tropical Weierstrass weights
Room B332 IBS (기초과학연구원)I will introduce a new structure on finite graphs, which takes the form of a labeling of the vertices by nonnegative integers (possibly repeated). This labeling is isomorphism invariant, and …
-
Stefan Weltge, The relaxation complexity of the standard simplex is logarithmic
Room B332 IBS (기초과학연구원)For a set $X$ of integer points, the relaxation complexity $\operatorname{rc}(X)$ is the smallest number of facets of any polyhedron P whose integer points are precisely those of X. In …
-
2026 Workshop on Topological Combinatorics
GISTThe 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 …
-
-
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 …
-
2026 Korean Student Combinatorics Workshop
Gongju Hanok Village, GongjuWebsite: https://kscw.combinatorics.kr/