Greedy clique decompositions and the Turán numbers

DOI10.1016/0195-6698(95)90018-7MaRDI QIDQ1896337zbMATH OpenOpenAlexFDO

Authors 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

decompositionmaximal cliquegreedy clique decompositionsTurán numbers

Mathematics Subject Classification ID

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

Recommendations

• Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs
• scientific article; zbMATH DE number 1792630
• Greedy maximum-clique decompositions
• scientific article; zbMATH DE number 6093217
• The greedy clique decomposition of a graph

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 4196017 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Complete subgraphs with large degree sums
• Greedy maximum-clique decompositions
• Large dense neighbourhoods and Turán's theorem
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs
• The Representation of a Graph by Set Intersections
• The greedy clique decomposition of a graph

Cited in

(4)

• Greedy friendship decompositions of graphs
• The greedy clique decomposition of a graph
• A closer look at manifest consequence
• scientific article; zbMATH DE number 1792630 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896337)