Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)

172 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Hamilton cycles in graphs and hypergraphs: an extremal perspective (2014, background): “Hypergraph generalisations of Walecki’s theorem (Theorem 3.6) have also been investigated.”
$F$-factors in hypergraphs via absorption (2011, methodology): “We recommend [21] for a survey of the recent developments in tl (n, k).”
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (2016, unknown): “the surveys [41, 52, 53].”
The existence of designs (2014, methodology): “At this level of generality, our local modification method sounds somewhat similar to that of Gustavsson, and also to the ‘absorbing method’ of Rödl, Ruciński and Szemerédi [35].”
A Geometric Theory for Hypergraph Matching (2011, background): “For example, consider the result of Rödl, Ruciński and Szemerédi [37] on the minimum degree threshold for a perfect matching in a k-graph.”
Surveys in Combinatorics 2011: Hypergraph Turán problems (2011, methodology): “We refer the reader to the surveys [119] for graphs and [161] for hypergraphs.”