On extremal hypergraphs for Hamiltonian cycles
From MaRDI portal
(Redirected from Publication:412248)
Abstract: We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur'an- and Dirac-type results. While the Tur'an-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely on the minimum vertex degree.
Recommendations
- On extremal hypergraphs for Hamiltonian cycles
- On Hamiltonian cycles in hypergraphs with dense link graphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
Cites work
- scientific article; zbMATH DE number 3506739 (Why is no real title available?)
- scientific article; zbMATH DE number 3641483 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Arc coverings of graphs
- 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
- Hypergraph extensions of the Erdős-Gallai theorem
- On perfect matchings in uniform hypergraphs with large minimum vertex degree
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Some Theorems on Abstract Graphs
- Steiner system and large non-Hamiltonian hypergraphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(37)- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
- Edge correlations in Random regular hypergraphs and applications to subgraph testing
- Extremal \(k\)-edge-Hamiltonian hypergraphs
- scientific article; zbMATH DE number 4027513 (Why is no real title available?)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 5130728 (Why is no real title available?)
- Recent advances on the Hamiltonian problem: survey III
- On the minimum size of Hamilton saturated hypergraphs
- Extension of paths and cycles for hypergraphs
- Hamilton cycles in hypergraphs below the Dirac threshold
- Hamiltonicity in cherry-quasirandom 3-graphs
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
- scientific article; zbMATH DE number 6829379 (Why is no real title available?)
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Limiting distribution of short cycles in inhomogeneous random uniform hypergraph
- The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
- Upper bounds on the minimum size of Hamilton saturated hypergraphs
- Families of triples with high minimum degree are Hamiltonian
- The Turán number of sparse spanning graphs
- On extremal hypergraphs for Hamiltonian cycles
- On powers of tight Hamilton cycles in randomly perturbed hypergraphs
- An abstraction of Whitney's broken circuit theorem
- Minimum degree conditions for tight Hamilton cycles
- Hypergraph extensions of the Erdős-Gallai theorem
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Hamilton saturated hypergraphs of essentially minimum size
- The Turán number for spanning linear forests
- Hamiltonicity in randomly perturbed hypergraphs
- All feedback arc sets of a random Turán tournament have \(\lfloor{n}/{k}\rfloor-{k}+1\) disjoint \({k}\)-cliques (and this is tight)
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- On the rank of higher inclusion matrices
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
- On the Hamiltonicity of triple systems with high minimum degree
- Forbidding Hamilton cycles in uniform hypergraphs
- On hyper-Hamiltonicity in graphs
This page was built for publication: On extremal hypergraphs for Hamiltonian cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412248)
