Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
From MaRDI portal
Publication:544011
DOI10.1016/j.aim.2011.03.007zbMath1220.05083OpenAlexW1970254348MaRDI QIDQ544011
Vojtěch Rödl, Andrzej Ruciński, Endre Szemerédi
Publication date: 14 June 2011
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2011.03.007
Related Items
Spanning surfaces in \(3\)-graphs, Counting Hamilton cycles in Dirac hypergraphs, Extension of paths and cycles for hypergraphs, Bounds on the number of edges in hypertrees, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, Tight cycles in hypergraphs, Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths, Hamiltonian paths and cycles in some 4-uniform hypergraphs, The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph, Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths, On powers of tight Hamilton cycles in randomly perturbed hypergraphs, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, Uniform Turán density of cycles, On extremal hypergraphs for Hamiltonian cycles, Existence of the map \(det^{S^3}\), Minimum degree conditions for tight Hamilton cycles, A general approach to transversal versions of Dirac‐type theorems, Properly colored Hamilton cycles in Dirac-type hypergraphs, On Degree Sequences Forcing The Square of a Hamilton Cycle, Recent advances on the Hamiltonian problem: survey III, On Tight Cycles in Hypergraphs, Forcing large tight components in 3-graphs, Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs, Families of triples with high minimum degree are Hamiltonian, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Tight cycles and regular slices in dense hypergraphs, On the Hamiltonicity of triple systems with high minimum degree, An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs, Forbidding Hamilton cycles in uniform hypergraphs, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, On Hamiltonian Berge cycles in [3-uniform hypergraphs], Hamilton cycles in hypergraphs below the Dirac threshold, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, Hamiltonicity in randomly perturbed hypergraphs, Decomposing hypergraphs into cycle factors, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamilton connected graphs
- The Ramsey number for hypergraph cycles. I.
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Matchings in 3-uniform hypergraphs
- A correlation inequality for bipartite graphs
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Hamiltonian chains in hypergraphs
- Extremal problems on set systems
- Some Theorems on Abstract Graphs
- On a problem of K. Zarankiewicz
