Skip to main content
Springer Nature Link
Log in

Greedy maximum-clique decompositions

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

A greedy clique decomposition of a graph is obtained by removing maximal cliques from a graph one by one until the graph is empty. We have recently shown that any greedy clique decomposition of a graph of ordern has at mostn 2/4 cliques. A greedy max-clique decomposition is a particular kind cf greedy clique decomposition where maximum cliques are removed, instead of just maximal ones. In this paper, we show that any greedy max-clique decompositionC of a graph of ordern has

, wheren(C) is the number of vertices inC.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Berge:Graphs and Hypergraphs, North-Holland-American Elsevier (1973).

  2. B. Bollobás:Extremal Graph Theory, Acad. Press London (1978).

    Google Scholar 

  3. F. R. K. Chung: On the decomposition of graphs,Siam J. Alg. and Disc. Methods 2 (1981), 1–12.

    Google Scholar 

  4. P. Erdős, A. W. Goodman, andL. Pósa: The representation of graphs by set intersections,Canad. J. Math. 18 (1966), 106–112.

    Google Scholar 

  5. E. Győri andA. V. Kostochka: On a problem of G. O. H. Katona and T. Tarjan,Acta Math. Acad. Sci. Hung. 34 (1979), 321–327.

    Google Scholar 

  6. E. Győri,andZ. Tuza: Decompositions of graphs into complete subgraphs of given order,Studia Sci. Math. Hung. 22 (1987), 315–320.

    Google Scholar 

  7. S. McGuinness: The greedy clique decomposition of a graph, to appear inJournal of Graph Theory.

  8. S. McGuinness: Restricted greedy clique decompositions and greedy clique decompositions ofK 4-free graphs,Combinatorica,14 (1994), (3), 321–334.

    Google Scholar 

  9. P. Winkler:Problems from the Petersen Conference, Hinsdgavl, Denmark (1990).

Download references

Author information

Author notes

  1. Sean McGuinness

    Present address: Dept. of Mathematics, University of Umeå, Umeå, Sweden

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Odense University, Odense, Denmark

    Sean McGuinness

Authors
  1. Sean McGuinness
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

McGuinness, S. Greedy maximum-clique decompositions. Combinatorica 14, 335–343 (1994). https://doi.org/10.1007/BF01212981

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01212981

AMS subject classification code (1991)