The Doyen?Wilson theorem for minimum coverings with triples

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1997)5:5<341::AID-JCD3>3.0.CO;2-F" /><341::AID-JCD3>3.0.CO;2-F 10.1002/(SICI)1520-6610(1997)5:5<341::AID-JCD3>3.0.CO;2-FzbMath0912.05011OpenAlexW2094085502MaRDI QIDQ4221884

C. A. Rodger, Hung-Lin Fu, Charles C. Lindner

Publication date: 16 May 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1997)5:5<341::aid-jcd3>3.0.co;2-f

zbMATH Keywords

Steiner triple systemminimum covering

Mathematics Subject Classification ID

Triple systems (05B07) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

Embedding coverings of 2-paths with 3-paths ⋮ Two Doyen-Wilson theorems for maximum packings with triples ⋮ The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles ⋮ On balanced incomplete block designs with specified weak chromatic number

This page was built for publication: The Doyen?Wilson theorem for minimum coverings with triples