On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)

DOI10.1016/0012-365X(91)90267-6zbMath0758.05038WikidataQ56850770 ScholiaQ56850770MaRDI QIDQ1182924

S. Singh

Publication date: 28 June 1992

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

zbMATH Keywords

covering systemcovering of \(t\)-sets

Mathematics Subject Classification ID

Steiner systems in finite geometry (51E10) Combinatorial aspects of packing and covering (05B40)

Related Items (7)

What we know and what we do not know about Turán numbers ⋮ Turán problems on non-uniform hypergraphs ⋮ Optimal covering designs: complexity results and new bounds ⋮ New coverings oft-sets with (t + 1)-sets ⋮ Bounds on the sizes of constant weight covering codes ⋮ The minimum likely column cover problem ⋮ Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)

Cites Work

• A new approach to Turán's conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)