Greedy clique decompositions and the Turán numbers


an Numbers Sean McGuinness University of Ume a September, 1994 Abstract. In this paper, we show that for p 4 if C is a clique decomposition obtained by removing maximal cliques(ie. their edges) of order at least p one by one until none remain, in which case the remaining edges are removed one by one, then the sum of the orders of the cliques in C is at most 2tp 1(n): Here tp 1(n) denotes the number of edges in the Tur an graph of order n which has no cliques of order p:

DOI: 10.1016/0195-6698(95)90018-7

Extracted Key Phrases

Cite this paper

@article{McGuinness1995GreedyCD, title={Greedy clique decompositions and the Tur{\'a}n numbers}, author={Sean McGuinness}, journal={Eur. J. Comb.}, year={1995}, volume={16}, pages={371-380} }