A graphical proof of the nonexistence of BIB(7,b,r,3,\(\lambda\) \(| 16)\) designs
From MaRDI portal
Publication:1113910
DOI10.1016/0378-3758(88)90084-5zbMath0662.05011MaRDI QIDQ1113910
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
bipartite graph; BIB designs with repeated blocks; balanceable graph; figure around a variety; incomplete block desings; support of a design
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