On extremal hypergraphs for Hamiltonian cycles

DOI10.1016/J.EJC.2011.10.003zbMATH Open1237.05142arXiv1111.7028OpenAlexW1993865305MaRDI QIDQ412248FDOQ412248

Roman Glebov, Yury Person, Wilma Weps

Publication date: 4 May 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1111.7028

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

zbMATH Keywords

Dirac-type resultsexact thresholdHamiltonian cycles in hypergraphsminimum vertex degreeTuran-type results

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Some Theorems on Abstract Graphs
• Perfect matchings in large uniform hypergraphs with large minimum collective degree
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• Hamiltonian chains in hypergraphs
• Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
• Hypergraph extensions of the Erdős-Gallai theorem
• Title not available (Why is that?)
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Arc coverings of graphs

Cited In (36)

• Extremal \(k\)-edge-Hamiltonian hypergraphs
• Title not available (Why is that?)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Title not available (Why is that?)
• 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
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Title not available (Why is that?)
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Limiting distribution of short cycles in inhomogeneous random uniform hypergraph
• All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight)
• The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
• Families of triples with high minimum degree are Hamiltonian
• Upper bounds on the minimum size of Hamilton saturated hypergraphs
• On extremal hypergraphs for Hamiltonian cycles
• The Turán number of sparse spanning graphs
• On powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Minimum degree conditions for tight Hamilton cycles
• An abstraction of Whitney's broken circuit theorem
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Hypergraph extensions of the Erdős-Gallai theorem
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Hamilton saturated hypergraphs of essentially minimum size
• Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing
• The Turán number for spanning linear forests
• Hamiltonicity in randomly perturbed hypergraphs
• 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
• On hyper-Hamiltonicity in graphs
• Forbidding Hamilton cycles in uniform hypergraphs
• Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths

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)