Loose Hamilton cycles in hypergraphs
From MaRDI portal
Publication:629193
DOI10.1016/j.disc.2010.11.013zbMath1226.05187arXiv0808.1713OpenAlexW1999115197MaRDI QIDQ629193
Deryk Osthus, Peter Keevash, Daniela Kühn, Richard Mycroft
Publication date: 8 March 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.1713
Related Items
Packing tight Hamilton cycles in 3-uniform hypergraphs, Counting Hamilton cycles in Dirac hypergraphs, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, Packing hamilton cycles in random and pseudo-random hypergraphs, Cycles and matchings in randomly perturbed digraphs and hypergraphs, The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, Improved monochromatic loose cycle partitions in hypergraphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, 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, Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version, Embedding spanning bounded degree subgraphs in randomly perturbed graphs, Phase transitions in a power-law uniform hypergraph, Properly colored Hamilton cycles in Dirac-type hypergraphs, Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs, Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues, Recent advances on the Hamiltonian problem: survey III, Families of triples with high minimum degree are Hamiltonian, Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version, Limiting distribution of short cycles in inhomogeneous random uniform hypergraph, EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS, On the Hamiltonicity of triple systems with high minimum degree, Forbidding Hamilton cycles in uniform hypergraphs, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs, Hamilton cycles in hypergraphs below the Dirac threshold, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Hamilton cycles in quasirandom hypergraphs, A hypergraph blow-up lemma, 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, A geometric theory for hypergraph matching, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Weighted sums of certain dependent random variables
- A hypergraph blow-up lemma
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Hamiltonian chains in hypergraphs
- Regularity Lemma for k-uniform hypergraphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- Some Theorems on Abstract Graphs
