Name: Stefan Weltge, The relaxation complexity of the standard simplex is logarithmic
Start: 2026-06-19T16:30:00+09:00
End: 2026-06-19T17:30:00+09:00
Location: Room B332

S	M	T	W	T	F	S
	0 events 1 0 events, 1	1 event 2 1 event, 2 4:30 PM - 5:30 PM Maria Chudnovsky, Induced minors and treewidth June 2 Tuesday @ 4:30 PM - 5:30 PM KST 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 graph as induced minors, and some complete graph as a subgraph. Unfortunately, such classes still contain graphs of arbitrarily large treewidth. Moreover, a result of … Continue Reading	0 events 3 0 events, 3	0 events 4 0 events, 4	0 events 5 0 events, 5	0 events 6 0 events, 6
0 events 7 0 events, 7	0 events 8 0 events, 8	1 event 9 1 event, 9 4:30 PM - 5:30 PM J. Pascal Gollin, Dominated balanced separators in wheel-induced-minor-free graphs June 9 Tuesday @ 4:30 PM - 5:30 PM KST J. Pascal Gollin, Dominated balanced separators in wheel-induced-minor-free graphs 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 of the graph, as follows. Every graph that excludes some planar graph as a minor has a balanced separator of bounded size. Building on this … Continue Reading	0 events 10 0 events, 10	0 events 11 0 events, 11	0 events 12 0 events, 12	0 events 13 0 events, 13
0 events 14 0 events, 14	0 events 15 0 events, 15	1 event 16 1 event, 16 4:30 PM - 5:30 PM Harry Richman, Distinguishing graphs with tropical Weierstrass weights June 16 Tuesday @ 4:30 PM - 5:30 PM KST Harry Richman, Distinguishing graphs with tropical Weierstrass weights 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 seems to reflect some mix of local and global structure of the graph. I will describe an algorithm for computing these labels, which uses a … Continue Reading	0 events 17 0 events, 17	0 events 18 0 events, 18	1 event 19 1 event, 19 4:30 PM - 5:30 PM Stefan Weltge, The relaxation complexity of the standard simplex is logarithmic June 19 Friday @ 4:30 PM - 5:30 PM KST Stefan Weltge, The relaxation complexity of the standard simplex is logarithmic 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 this paper, we focus on the case where X is the discrete standard simplex $\Delta_d = \{0, e_1, ..., e_d\}$. We show that $\operatorname{rc}(\Delta_d) = … Continue Reading	0 events 20 0 events, 20
0 events 21 0 events, 21	0 events 22 0 events, 22	0 events 23 0 events, 23	0 events 24 0 events, 24	0 events 25 0 events, 25	0 events 26 0 events, 26	0 events 27 0 events, 27
1 event 28 1 event, 28 2026-06-28 2026 Workshop on Topological Combinatorics 2026 Workshop on Topological Combinatorics June 28 Sunday - July 11 Saturday 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 of Republic of Korea. The workshop aims to bring together researchers interested in applications of topology to combinatorics and related areas. This will be the … Continue Reading	1 event 29 1 event, 29 2026-06-28 2026 Workshop on Topological Combinatorics	1 event 30 1 event, 30 2026-06-28 2026 Workshop on Topological Combinatorics