Graph-Colouring and Combinatorial Numbers
Andrew Sobczyk · Canadian Journal of Mathematics · 1968
We shall use the termn-configurationfor the complete graph havingnvertices, which we visualize as a regular convex polygon. The sides and diagonals will be referred to asedges. A complete sub-configuration ofpvertices (subset ofpvertices with all interconnecting edges) will be called ap-tuple. A 3-tuple will be called a triple or triangle, a 4-tuple a quadruple, etc.