A graphical proof of the nonexistence of BIB(7,b,r,3,\(\lambda\) \(| 16)\) designs

DOI10.1016/0378-3758(88)90084-5zbMath0662.05011OpenAlexW2009948303MaRDI QIDQ1113910

A. S. Hedayat, W. M. Foody

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0378-3758(88)90084-5

zbMATH Keywords

bipartite graphBIB designs with repeated blocksbalanceable graphfigure around a varietyincomplete block desingssupport of a design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graph theory (05C99)

Related Items (1)

Median-unbiasedness and the Gauss-Markov property in finite population survey sampling

Cites Work

• The trade-off method in the construction of BIB designs with variable support sizes
• An algebraic study of BIB designs: a complete solution for v=6 and k=3
• Magic labelings of graphs, symmetric magic squares, systems of parameters, and Cohen-Macaulay rings
• On theory and applications of BIB designs with repeated blocks
• Linear homogeneous Diophantine equations and magic labelings of graphs
• Combinatorial Topology and the Trade Off Method in Bib Designs
• Magic Graphs
• A Note on Balanced Incomplete Block Designs
• Magic Valuations of Finite Graphs
• The Factors of Graphs

This page was built for publication: A graphical proof of the nonexistence of BIB(7,b,r,3,\(\lambda\) \(| 16)\) designs