Maria Chudnovsky, Induced minors and treewidth
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 …
7 events found.
Seminars and Colloquiums
Events
-
-
Room B332 IBS (기초과학연구원)
-
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 …
-
-
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 …
-
-
Meike Hatzel, TBA
Room B332 IBS (기초과학연구원) -
Jinyoung Park (박진영), TBA
Room B332 IBS (기초과학연구원)