Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
From MaRDI portal
Publication:2349508
Abstract: We show that for sufficiently large , every 3-uniform hypergraph on vertices with minimum vertex degree at least , where if and if , contains a loose Hamilton cycle. This degree condition is best possible and improves on the work of Buss, H`an and Schacht who proved the corresponding asymptotical result.
Recommendations
- Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Loose Hamilton cycles in random 3-uniform hypergraphs
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- scientific article; zbMATH DE number 7448677
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order
Cites work
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- An approximate Dirac-type theorem for k-uniform hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Families of triples with high minimum degree are Hamiltonian
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Hamiltonian chains in hypergraphs
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Loose Hamilton cycles in hypergraphs
- Matchings in 3-uniform hypergraphs
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
- On extremal hypergraphs for Hamiltonian cycles
- On Hamiltonian bipartite graphs
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- Perfect matchings in 4-uniform hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Some Theorems on Abstract Graphs
- Tight co-degree condition for perfect matchings in 4-graphs
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- Tiling 3-uniform hypergraphs with K₄^3-2e
Cited in
(40)- Hamilton -cycles in randomly perturbed hypergraphs
- Hamilton cycles in hypergraphs below the Dirac threshold
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
- Hamiltonicity in cherry-quasirandom 3-graphs
- Hamiltonian paths and cycles in some 4-uniform hypergraphs
- Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Properly colored Hamilton cycles in Dirac-type hypergraphs
- Perfect packings in quasirandom hypergraphs. I.
- Hamilton cycles in quasirandom hypergraphs
- Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- scientific article; zbMATH DE number 7448677 (Why is no real title available?)
- Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
- Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- On the Hamiltonicity of triple systems with high minimum degree
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs
- Forbidding Hamilton cycles in uniform hypergraphs
- Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
- Loose Hamiltonian cycles forced by large (k-2)-degree-approximate version
- 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
- A general approach to transversal versions of Dirac‐type theorems
- Embedding loose spanning trees in 3-uniform hypergraphs
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs
- A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
- A note on Hamilton -cycle decomposition of complete k-partite hypergraphs
- Transversal Hamilton cycle in hypergraph systems
- Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
- Dirac's theorem for linear hypergraphs
- Minimum vertex degree conditions for loose spanning trees in 3-graphs (extended abstract)
- Minimum degree conditions for Hamilton l-cycles in k-uniform hypergraphs
- Hamiltonicity in randomly perturbed hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
This page was built for publication: Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349508)
