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

DOI10.1016/J.EJC.2022.103659zbMath1505.05104arXiv2111.05020OpenAlexW4312159844MaRDI QIDQ2111195

Andrzej Żak, Andrzej Ruciński

Publication date: 28 December 2022

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

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

zbMATH Keywords

\(k\)-uniform \(n\)-vertex hypergraphsmaximally non-Hamiltonian graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Cites Work

• Upper bounds on the minimum size of Hamilton saturated hypergraphs
• Smallest maximally nonhamiltonian graphs
• Smallest maximally nonhamiltonian graphs. II
• Growth order for the size of smallest Hamiltonian chain saturated uniform hypergraphs
• Hamilton saturated hypergraphs of essentially minimum size
• On the minimum size of Hamilton saturated hypergraphs
• Hamiltonian chains in hypergraphs
• Variations on the Hamiltonian Theme

This page was built for publication: Constructing sparsest \(\ell\)-Hamiltonian saturated \(k\)-uniform hypergraphs for a wide range of \(\ell\)