Hamilton saturated hypergraphs of essentially minimum size

zbMath1266.05108MaRDI QIDQ1953507

Andrzej Żak, Andrzej Ruciński

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

zbMATH Keywords

hypergraphs; Hamiltonian cycles; saturation number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

05C38: Paths and cycles

05C45: Eulerian and Hamiltonian graphs

Related Items

Upper bounds on the minimum size of Hamilton saturated hypergraphs, Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\), On the minimum size of Hamilton saturated hypergraphs

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