On extremal hypergraphs for Hamiltonian cycles
From MaRDI portal
Publication:412248
DOI10.1016/j.ejc.2011.10.003zbMath1237.05142arXiv1111.7028OpenAlexW1993865305MaRDI QIDQ412248
Roman Glebov, Yury Person, Wilma Weps
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.7028
Dirac-type resultsexact thresholdHamiltonian cycles in hypergraphsminimum vertex degreeTuran-type results
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (30)
Hamiltonicity in cherry-quasirandom 3-graphs ⋮ Extension of paths and cycles for hypergraphs ⋮ On the rank of higher inclusion matrices ⋮ The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph ⋮ Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Hamilton saturated hypergraphs of essentially minimum size ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On the minimum size of Hamilton saturated hypergraphs ⋮ The Turán number for spanning linear forests ⋮ Families of triples with high minimum degree are Hamiltonian ⋮ An abstraction of Whitney's broken circuit theorem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Limiting distribution of short cycles in inhomogeneous random uniform hypergraph ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Forbidding Hamilton cycles in uniform hypergraphs ⋮ Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs ⋮ Unnamed Item ⋮ Upper bounds on the minimum size of Hamilton saturated hypergraphs ⋮ Hamilton cycles in hypergraphs below the Dirac threshold ⋮ Hypergraph extensions of the Erdős-Gallai theorem ⋮ The Turán number of sparse spanning graphs ⋮ Powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs ⋮ Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing ⋮ Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs ⋮ 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) ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
Cites Work
- Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Arc coverings of graphs
- 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
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Hypergraph Extensions of the Erdős-Gallai Theorem
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Hamiltonian chains in hypergraphs
- Some Theorems on Abstract Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On extremal hypergraphs for Hamiltonian cycles
