Constructing Block Designs from Complete Graphs
arXiv:2605.27719
Abstract
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of block designs using complete graphs, including two infinite families of designs using edge sets of complete graphs.
13 pages + 1 bibliography page, 8 figures,