Sampling complete designs
Combinatorics
2012-10-10 v2
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.
Keywords
Cite
@article{arxiv.0907.3199,
title = {Sampling complete designs},
author = {L. Giuzzi and A. Pasotti},
journal= {arXiv preprint arXiv:0907.3199},
year = {2012}
}
Comments
16 Pages [see the text for the full abstract]