Sampling complete designs
arXiv:0907.3199 · doi:10.1016/j.disc.2011.02.034
Abstract
In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are also provided.
16 Pages [see the text for the full abstract]