A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs

The study of asymptotic minimum degree thresholds that force matchings and tilings in hypergraphs is a lively area of research in combinatorics. A key breakthrough in this area was a result of H\`{a}n, Person and Schacht who proved that the asymptotic minimum vertex degree threshold for a perfect matching in an $n$-vertex $3$-graph is $\left(\frac{5}{9}+o(1)\right)\binom{n}{2}$. In this paper we improve on this result, giving a family of degree sequence results, all of which imply the result of H\`{a}n, Person and Schacht, and additionally allow one third of the vertices to have degree $\frac{1}{9}\binom{n}{2}$ below this threshold. Furthermore, we show that this result is, in some sense, tight.Comment: 21 page

Extremal problems in graphs

In the first part of this thesis we will consider degree sequence results for graphs. An important result of Komlós [39] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$-proportion of the vertices of $G$ (for any fixed $x ∈$ (0, 1) and graph $H$). In Chapter 2, we give a degree sequence strengthening of this result. A fundamental result of Kühn and Osthus [46] determines up to an additive constant the minimum degree threshold that forces a graph to contain a perfect $H$-tiling. In Chapter 3, we prove a degree sequence version of this result. We close this thesis in the study of asymmetric Ramsey properties in $G_n,_p$. Specifically, for fixed graphs $H_1, . . . , H_r,$ we study the asymptotic threshold function for the property $G_n,_p$ → $H_1, . . . , H_r$. Rödl and Ruciński [61, 62, 63] determined the threshold function for the general symmetric case; that is, when $H_1 = · · · = H_r$. Kohayakawa and Kreuter [33] conjectured the threshold function for the asymmetric case. Building on work of Marciniszyn, Skokan, Spöhel and Steger [51], in Chapter 4, we reduce the 0-statement of Kohayakawa and Kreuter’s conjecture to a more approachable, deterministic conjecture. To demonstrate the potential of this approach, we show our conjecture holds for almost all pairs of regular graphs (satisfying certain balancedness conditions)