How many graphs are unions of k‐cliques?

DOI10.1002/JGT.20138MaRDI QIDQ5471007zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Graham 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

asymptotic enumerationcliquesphase transitionrandom graphs

Mathematics Subject Classification ID

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

Recommendations

• An upper bound on the number of cliques in a graph
• scientific article; zbMATH DE number 3188526
• The number of cliques in graphs of given order and size
• scientific article; zbMATH DE number 3762108
• On the number of edge disjoint cliques in graphs of given size

Cited in

(5)

• A tale of stars and cliques
• Cliques in the union of graphs
• How many cliques can a clique cover cover?
• Tangled paths: a random graph model from Mallows permutations
• Graph partition into small cliques

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)