Hamilton saturated hypergraphs of essentially minimum size
From MaRDI portal
Publication:1953507
zbMath1266.05108MaRDI QIDQ1953507
Publication date: 7 June 2013
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p25
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
On the minimum size of Hamilton saturated hypergraphs ⋮ Upper bounds on the minimum size of Hamilton saturated hypergraphs ⋮ Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On extremal hypergraphs for Hamiltonian cycles
- Loose Hamilton cycles in random uniform hypergraphs
- The Ramsey number for hypergraph cycles. I.
- Hamilton-chain saturated hypergraphs
- Loose Hamilton cycles in random 3-uniform hypergraphs
- Smallest maximally nonhamiltonian graphs
- Smallest maximally nonhamiltonian graphs. II
- Nombres de coloration de l'hypergraphe h-parti complet
- Growth order for the size of smallest Hamiltonian chain saturated uniform hypergraphs
- Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
- Hamiltonian chains in hypergraphs
- Tight Hamilton cycles in random uniform hypergraphs
- Variations on the Hamiltonian Theme
This page was built for publication: Hamilton saturated hypergraphs of essentially minimum size