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
We study the fundamental problem of finding small dense subgraphs in a given graph. For a real number
The Erdős-Sós conjecture states that the maximum number of edges in an
A graph class
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. …
Consider the following hat guessing game:
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 …
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 …
In a rainbow variant of the Turán problem, we consider
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 …
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 …