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
10 events found.
Discrete Math Seminar
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:
Tuan Tran, Complexity of null dynamical systems
Room B109 IBS (기초과학연구원)A theoretical dynamical system is a pair (X,T) where X is a compact metric space and T is a self homeomorphism of X. The topological entropy of a theoretical dynamical system …
Xuding Zhu (朱緒鼎), List version of 1-2-3 conjecture
Room B109 IBS (기초과학연구원)The well-known 1-2-3 Conjecture by Karoński, Łuczak and Thomason states that the edges of any connected graph with at least three vertices can be assigned weights 1, 2 or 3 …
Andrzej Grzesik, Rainbow Turán problems
Room S221 IBS (기초과학연구원) Science Culture CenterIn a rainbow variant of the Turán problem, we consider
Dong Yeap Kang (강동엽), Hamilton cycles and optimal matchings in a random subgraph of uniform Dirac hypergraphs
Room B332 IBS (기초과학연구원)A loose cycle is a cyclic ordering of edges such that every two consecutive edges share exactly one vertex. A cycle is Hamilton if it spans all vertices. A codegree …
Daniel Kráľ, High chromatic common graphs
Room B332 IBS (기초과학연구원)Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. As probabilistic constructions often provide good bounds on …