Greedy clique decompositions and the Turán numbers

DOI10.1016/0195-6698(95)90018-7zbMATH Open0830.05049OpenAlexW2010027128MaRDI QIDQ1896337FDOQ1896337

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• The Representation of a Graph by Set Intersections
• Title not available (Why is that?)
• Complete subgraphs with large degree sums
• 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
• The greedy clique decomposition of a graph

Cited In (4)

• The greedy clique decomposition of a graph
• A closer look at manifest consequence
• Title not available (Why is that?)
• Greedy friendship decompositions of graphs

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)