Yunbum Kook (국윤범), Vertex Sparsification for Edge Connectivity
Room B232 IBS (기초과학연구원)Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether
10 events found.
Seminars and Colloquiums
Tuan Tran, Anti-concentration phenomena
Room B232 IBS (기초과학연구원)Let
Gwenaël Joret, Packing and covering balls in graphs excluding a minor
Zoom ID: 869 4632 6610 (ibsdimag)In 2007, Chepoi, Estellon, and Vaxès conjectured that there exists a universal constant
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 single line, then there are
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 G, where the width of a vertex partition (X,Y) in G is the size of a maximum induced matching in the bipartite graph induced by …
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. We review basic properties of stability and NIP. Finally, we aim to give several characterizations of stability and NIP of a given formula in terms of …
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. We review basic properties of stability and NIP. Finally, we aim to give several characterizations of stability and NIP of a given formula in terms of …
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. We review basic properties of stability and NIP. Finally, we aim to give several characterizations of stability and NIP of a given formula in terms of …
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, Whitney introduced matroids using some necessary conditions for this. However, complete characterizations with various techniques are intractable. This remains the case even if it is already known …
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 tree-width, which are characterized as those classes that exclude some planar graph as a minor. Similarly, in model theory, classes of structures are characterized by …