Brett Leroux, Expansion of random 0/1 polytopes

Zoom ID: 870 0312 9412 (ibsecopro) [CLOSED]

A conjecture of Milena Mihail and Umesh Vazirani states that the edge expansion of the graph of every $0/1$ polytope is at least one. Any lower bound on the edge expansion gives

Bjarne Schülke, A local version of Katona’s intersection theorem

Room B332 IBS (기초과학연구원)

Katona's intersection theorem states that every intersecting family $\mathcal F\subseteq^{(k)}$ satisfies $\vert\partial\mathcal F\vert\geq\vert\mathcal F\vert$, where $\partial\mathcal F=\{F\setminus x:x\in F\in\mathcal F\}$ is the shadow of $\mathcal F$. Frankl conjectured that for

Sebastian Wiederrecht, Killing a vortex

Room B332 IBS (기초과학연구원)

The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every $t\in\mathbb{N},$ there exists some constant $c_{t}$ such that every $K_{t}$-minor-free graph admits a tree

Alexander Clifton, Ramsey Theory for Diffsequences

Room B332 IBS (기초과학연구원)

Van der Waerden's theorem states that any coloring of $\mathbb{N}$ with a finite number of colors will contain arbitrarily long monochromatic arithmetic progressions. This motivates the definition of the van

Santiago Guzmán-Pro, Local expressions of graphs classes

Zoom ID: 869 4632 6610 (ibsdimag)

A common technique to characterize hereditary graph classes is to exhibit their minimal obstructions. Sometimes, the set of minimal obstructions might be infinite, or too complicated to describe. For instance, for any

IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.