István Tomon, Configurations of boxes
Room B332 IBS (기초과학연구원)Configurations of axis-parallel boxes in
10 events found.
Discrete Math Seminar
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
Oliver Janzer, Small subgraphs with large average degree
Room B332 IBS (기초과학연구원)We study the fundamental problem of finding small dense subgraphs in a given graph. For a real number
Suyun Jiang (江素云), How connectivity affects the extremal number of trees
Room B332 IBS (기초과학연구원)The Erdős-Sós conjecture states that the maximum number of edges in an
Minho Cho (조민호), Strong Erdős-Hajnal property on chordal graphs and its variants
Room B332 IBS (기초과학연구원)A graph class
Guanghui Wang (王光辉), Embeddings in uniformly dense hypergraphs
Room B332 IBS (기초과학연구원)An archetype problem in extremal combinatorics is to study the structure of subgraphs appearing in different classes of (hyper)graphs. We will focus on such embedding problems in uniformly dense hypergraphs. …
Chong Shangguan (上官冲), The hat guessing number of graphs
Room B332 IBS (기초과학연구원)Consider the following hat guessing game: