How many graphs are unions of k‐cliques?

DOI10.1002/JGT.20138zbMath1093.05029OpenAlexW4242132243MaRDI QIDQ5471007

Béla Bollobás, Graham R. Brightwell

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) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Graph partition into small cliques

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