How many graphs are unions of k‐cliques?

DOI10.1002/JGT.20138zbMATH Open1093.05029OpenAlexW4242132243MaRDI QIDQ5471007FDOQ5471007

Graham Brightwell, Béla Bollobás

Publication date: 6 June 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20138

zbMATH Keywords

phase transitionrandom graphsasymptotic enumerationcliques

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Cited In (2)

• Graph partition into small cliques
• How many cliques can a clique cover cover?

   Recommendations

• An upper bound on the number of cliques in a graph 👍 👎
• Title not available (Why is that?) 👍 👎
• The number of cliques in graphs of given order and size 👍 👎
• Title not available (Why is that?) 👍 👎
• On the number of edge disjoint cliques in graphs of given size 👍 👎

This page was built for publication: How many graphs are unions of k‐cliques?

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