Extremal \(k\)-edge-Hamiltonian hypergraphs
From MaRDI portal
Publication:2476283
DOI10.1016/j.disc.2007.07.074zbMath1137.05051OpenAlexW2178910810MaRDI QIDQ2476283
Publication date: 18 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.074
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Eulerian and Hamiltonian graphs (05C45)
Related Items
Hypergraph Extensions of the Erdős-Gallai Theorem, Extension of paths and cycles for hypergraphs, Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths, On \((K_q,k)\) vertex stable graphs with minimum size, Extremal \(P_4\)-stable graphs, Recent advances on the Hamiltonian problem: survey III, General lower bound on the size of \((H; k)\)-stable graphs, Hamilton-chain saturated hypergraphs, Hypergraph extensions of the Erdős-Gallai theorem, A generalization of an independent set with application to \((K_q; k)\)-stable graphs, On (Kq;k)-Stable Graphs
Cites Work
