Constructions via Hamiltonian theorems

DOI10.1016/j.disc.2005.03.029zbMath1077.05096OpenAlexW2029330971MaRDI QIDQ2576854

No author found.

Publication date: 29 December 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/21067/1/paper_104.pdf

zbMATH Keywords

designBaranyai's theoremHamiltonian cyclefamilies of subsets

Mathematics Subject Classification ID

Extremal set theory (05D05) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

The cyclic matching sequenceability of regular graphs ⋮ The \(r\)-matching sequencibility of complete graphs ⋮ Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ Sparse Kneser graphs are Hamiltonian ⋮ The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs

Cites Work

• Steiner quadruple systems - a survey
• Proof of the Seymour conjecture for large graphs
• Design type problems motivated by database theory
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• Hamiltonian chains in hypergraphs
• Some Theorems on Abstract Graphs
• Pairs of disjoint \(q\)-element subsets far from each other
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructions via Hamiltonian theorems