Abstract
The problem is considered of decomposing a given graph into the minimum number of complete subgraphs. Asymptotic results are obtained for the case where the graph is the complement of a graph with relatively few unisolated vertices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. G. de Bruijn andP. Erdős, On a combinatorial problem.Indag. Math. 10 (1948), 421–423.
H. L. Montgomery,Topics In Multiplicative Number Theory,Lecture Notes in Mathematics 227, Springer-Verlag, Berin, 1971.
J. Orlin, Contentment in graph theory: covering graphs with cliques.Indag. Math. 39 (1977), 406–424.
N. J. Pullman andA. Donald, Clique coverings of graphs II: complements of cliques.Utilitas Math. 19 (1981) (to appear).
Author information
Authors and Affiliations
Additional information
This research was carried out while the author was visting Queen’s University, Kingston, whose hospitality is gratefully acknowledged.