Suyun Jiang (江素云), How connectivity affects the extremal number of trees
Suyun Jiang (江素云), How connectivity affects the extremal number of trees
The Erdős-Sós conjecture states that the maximum number of edges in an
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. In precise, we will mention the uniform Turan density of some hypergraphs.
Consider the following hat guessing game: