Maya Sankar, The Turán Numbers of Homeomorphs
Room B332 IBS (기초과학연구원)Let
10 events found.
Discrete Math Seminar
Eunjin Oh (오은진), Parameterized algorithms for the planar disjoint paths problem
Room B332 IBS (기초과학연구원)Given an undirected planar graph
Stijn Cambie, Recent progress on the Union-closed conjecture and related
Room B332 IBS (기초과학연구원)We give a summary on the work of the last months related to Frankl's Union-Closed conjecture and its offsprings. The initial conjecture is stated as a theorem in extremal set …
Younjin Kim (김연진), Problems on Extremal Combinatorics
Room B332 IBS (기초과학연구원)Extremal Combinatorics studies the maximum or minimum size of finite objects (numbers, sets, graphs) satisfying certain properties. In this talk, I introduce the conjectures I solved on Extremal Combinatorics, and …
Tianchi Yang, On the maximum number of edges in k-critical graphs
Room B332 IBS (기초과학연구원)In this talk, we will discuss the problem of determining the maximum number of edges in an n-vertex k-critical graph. A graph is considered k-critical if its chromatic number is …
István Tomon, Configurations of boxes
Room B332 IBS (기초과학연구원)Configurations of axis-parallel boxes in
James Davies, Two structural results for pivot-minors
Room B332 IBS (기초과학연구원)Pivot-minors can be thought of as a dense analogue of graph minors. We shall discuss pivot-minors and two recent results for proper pivot-minor-closed classes of graphs. In particular, that for …
Hyunwoo Lee (이현우), On perfect subdivision tilings
Room B332 IBS (기초과학연구원)For a given graph
Rob Morris, An exponential improvement for diagonal Ramsey
Room B332 IBS (기초과학연구원)The Ramsey number
Jozef Skokan, Separating the edges of a graph by a linear number of paths
Room B332 IBS (기초과학연구원)Recently, Letzter proved that any graph of order n contains a collection P of