Families of triples with high minimum degree are Hamiltonian
From MaRDI portal
Publication:2450131
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
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hamiltonian chains in hypergraphs
- scientific article; zbMATH DE number 5720905 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Loose Hamilton cycles in hypergraphs
- Matchings in 3-uniform hypergraphs
- Matchings in hypergraphs of large minimum degree
- Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
- On extremal hypergraphs for Hamiltonian cycles
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- Perfect matchings and K₄^3-tilings in hypergraphs of large codegree
- Perfect matchings in 3-uniform hypergraphs with large vertex degree
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Perfect matchings in uniform hypergraphs with large minimum degree
Cited in
(14)- Hamilton cycles in hypergraphs below the Dirac threshold
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- On the Hamiltonicity of triple systems with high minimum degree
- Forbidding Hamilton cycles in uniform hypergraphs
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Minimum degree conditions for tight Hamilton cycles
- Minimum pair-degee for tight Hamiltonian cycles in 4-uniform hypergraphs
- Transversal Hamilton cycle in the hypergraph system
- Hamiltonicity in randomly perturbed hypergraphs
This page was built for publication: Families of triples with high minimum degree are Hamiltonian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450131)
