论文信息 - On complementary decompositions of the complete graph

On complementary decompositions of the complete graph

We consider decompositionsKn → H, whereH is eitherP3 (the path with 3 edges) or the complete bipartite graphK1, 3, with the property that upon taking the complement of each graph in the decomposition one obtains a new decompositionKn → Hc.

[1] H. Hanani. The Existence and Construction of Balanced Incomplete Block Designs , 1961 .

[2] Douglas R. Stinson,et al. Steiner pentagon systems , 1984, Discret. Math..

[3] Douglas R. Stinson. The spectrum of nested Steiner triple systems , 1985, Graphs Comb..

[4] Andries E. Brouwer,et al. Optimal Packings of K4's into a Kn , 1979, J. Comb. Theory A.

[5] A. E. Brouwer,et al. Optimal packings of $K_4$'s into a K$_n$ : the case n $\equiv$ 5 (mod 6) , 1976 .