Maya Sankar, The Turán Numbers of Homeomorphs
Room B332 IBS (기초과학연구원)Let
Let
Given an undirected planar graph
A subset
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 …
In 1977, Erdős and Hajnal made the conjecture that, for every graph
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 …
In 1993, Erdős, Hajnal, Simonovits, Sós and Szemerédi proposed to determine the value of Ramsey-Turán density
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 …
Configurations of axis-parallel boxes in
We consider the spanning tree embedding problem in dense graphs without bipartite holes and sparse graphs. In 2005, Alon, Krivelevich and Sudakov asked for determining the best possible spectral gap …