A retrospective look at the Erdös-DeBruijn theorem

DOI10.1016/S0378-3758(96)00069-9zbMATH Open0881.05017MaRDI QIDQ1361671FDOQ1361671

R. G. Stanton

Publication date: 24 November 1997

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Recommendations

• Minimal pairwise balanced designs
• scientific article
• scientific article; zbMATH DE number 2104810
• Pairwise balanced designs on \(4s+1\) points with longest block of cardinality \(2s\)

zbMATH Keywords

perfect packingpairwise balanced designperfect covering

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Title not available (Why is that?)
• On the number of blocks in a perfect covering of v points
• Exact Covering Configurations and Steiner Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The λ-μ Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Pairwise balanced designs and sigma clique partitions

This page was built for publication: A retrospective look at the Erdös-DeBruijn theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361671)