A Dirac-Type Theorem for 3-Uniform Hypergraphs

By Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi. Combinatorics, probability & computing, 2006

303 citations recorded by the source corpus.

Subfields: Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/e78ed0b323ef88c11fc75e1a72e63c5e9bc826b5

How researchers see this paper

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

In Discrete Mathematics and Combinatorics

In Electrical and Electronic Engineering

In Geometry and Topology

Citations in the corpus

The existence of designs via iterative absorption (2016, methodology): “Such an approach was introduced systematically by Rödl, Ruciński and Szemerédi [37] in order to find spanning structures in graphs and hypergraphs (but actually goes back further than this, see e.g. Krivelevich [26]).”
A Geometric Theory for Hypergraph Matching (2011, background): “[1, 6, 7, 10, 11, 14, 19, 25, 26, 27, 28, 30, 31, 33, 35, 36, 38, 39, 40, 44, 47, 48, 49, 57] and the survey by Rödl and Ruciński [46] for details.”
Recent advances on Dirac-type problems for hypergraphs (2015, methodology): “Most aforementioned results were obtained by the absorbing method, initiated by Rödl, Ruciński, and Szemerédi [70].”
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (2016, methodology): “Such an approach was introduced systematically by Rödl, Ruciński and Szemerédi [42] in order to find spanning structures in graphs and hypergraphs (but actually goes back further than this, see e.”
Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs (2009, background): “The case r = 3 of Theorems 28 and 29 was proved earlier in [116] and [95] respectively.”
Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs (2011, methodology): “In [19] and [20] we proved an approximate version of the conjecture.”
Hamilton cycles in graphs and hypergraphs: an extremal perspective (2014, methodology): “A Dirac-type theorem for tight Hamilton cycles was proved by Rödl, Ruciński and Szemerédi [129, 130].”