论文信息 - Clique partitions of the cocktail party graph

Clique partitions of the cocktail party graph

Abstract Let T v denote the complenent of a perfect matching in the complete graph on v vertices, v even, and let cp (T v ) be the minimum number of cliques needed to partition the edge-set of T v . We prove that cp (T v ) ⩾ v for v ⩾ 8 and give a design characterization of the cases where equality holds. We also show that, asymptotically, cp (T v ) ⩽ v log log v .

David A. Gregory | Walter D. Wallis | S. McGuinness

[1] D. R. Heath-Brown,et al. On the difference between consecutive primes , 1979 .

[2] W. S. Connor,et al. Combinatorial Properties of Group Divisible Incomplete Block Designs , 1952 .

[3] H. Tverberg,et al. On the decomposition of kn into complete bipartite graphs , 1982, J. Graph Theory.

[4] N. F. Gjeddebæk. On the difference between consecutive primes , 1966 .

[5] J. Orlin. Contentment in graph theory: Covering graphs with cliques , 1977 .

[6] R. Graham,et al. On embedding graphs in squashed cubes , 1972 .

[7] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[8] H.J Ryser,et al. Subsets of a Finite Set That Intersect Each Other in At Most One Element , 1974, J. Comb. Theory, Ser. A.

[9] G. W. Peck,et al. A new proof of a theorem of Graham and Pollak , 1984, Discret. Math..

[10] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[11] H. J. Ryser. Variants of cyclic difference sets , 1973 .

[12] Ronald L. Graham,et al. On the addressing problem for loop switching , 1971 .