On the minimum size of Hamilton saturated hypergraphs

DOI10.37236/8414zbMath1453.05081OpenAlexW3112182154MaRDI QIDQ2213813

Andrzej Żak, Andrzej Ruciński

Publication date: 3 December 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8414

zbMATH Keywords

\(\ell\)-Hamiltonian saturated hypergraph\(\ell\)-overlapping \(k\)-cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Distance in graphs (05C12)

Related Items (1)

Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\)

Cites Work

• Unnamed Item
• On extremal hypergraphs for Hamiltonian cycles
• Upper bounds on the minimum size of Hamilton saturated hypergraphs
• Smallest maximally nonhamiltonian graphs
• Smallest maximally nonhamiltonian graphs. II
• Hamilton saturated hypergraphs of essentially minimum size
• Hamiltonian chains in hypergraphs
• Variations on the Hamiltonian Theme

This page was built for publication: On the minimum size of Hamilton saturated hypergraphs