Ben Lund, Point-plane incidence bounds
Room B232 IBS (기초과학연구원)In the early 1980s, Beck proved that, if P is a set of n points in the real plane, and no more than g points of P lie on any …
Loading view.
Nick Brettell, On the graph width parameter mim-width
Zoom ID: 869 4632 6610 (ibsdimag)Maximum induced matching width, also known as mim-width, is a width parameter for graphs introduced by Vatshelle in 2012. This parameter can be defined over branch decompositions of a graph …
Junguk Lee (이정욱), A quick introduction to stability and NIP: Part I. Basic first order logic
Room B232 IBS (기초과학연구원)I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. …
Junguk Lee (이정욱), A quick introduction to stability and NIP: Part II. Stability
Room B232 IBS (기초과학연구원)I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. …
Junguk Lee (이정욱), A quick introduction to stability and NIP: Part III. NIP
Room B232 IBS (기초과학연구원)I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. …
Rutger Campbell, Disasters in abstracting combinatorial properties of linear dependence
Room B232 IBS (기초과학연구원)Let E be a finite set and I be a collection of subsets of E. When is there a set of real vectors indexed by E such that I correspond to its linearly independent subsets? In 1935, …
Sebastian Siebertz, Rank-width meets stability
Zoom ID: 869 4632 6610 (ibsdimag)Forbidden graph characterizations provide a convenient way of specifying graph classes, which often exhibit a rich combinatorial and algorithmic theory. A prime example in graph theory are classes of bounded …
Debsoumya Chakraborti, Maximum number of cliques in a graph with bounded maximum degree
Room B232 IBS (기초과학연구원)Generalized extremal problems have been one of the central topics of study in extremal combinatorics throughout the last few decades. One such simple-looking problem, maximizing the number of cliques of …
Luke Postle, Further progress towards Hadwiger’s conjecture
Zoom ID: 869 4632 6610 (ibsdimag)In 1943, Hadwiger conjectured that every graph with no $K_t$ minor is $(t-1)$-colorable for every $t\ge 1$. In the 1980s, Kostochka and Thomason independently proved that every graph with no $K_t$ …
Jinha Kim (김진하), Collapsibility of Non-Cover Complexes of Graphs
Room B232 IBS (기초과학연구원)Let $G$ be a graph on the vertex set $V$. A vertex subset $W \subset V$ is a cover of $G$ if $V \setminus W$ is an independent set of …