Greedy clique decompositions and the Turán numbers

DOI10.1016/0195-6698(95)90018-7zbMath0830.05049OpenAlexW2010027128MaRDI QIDQ1896337

Sean McGuiness

Publication date: 27 August 1995

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0195-6698(95)90018-7

zbMATH Keywords

decompositionTurán numbersmaximal cliquegreedy clique decompositions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A closer look at manifest consequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large dense neighbourhoods and Turán's theorem
• Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs
• Greedy maximum-clique decompositions
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• Complete subgraphs with large degree sums
• The greedy clique decomposition of a graph
• The Representation of a Graph by Set Intersections

This page was built for publication: Greedy clique decompositions and the Turán numbers