An upper bound on the size of the largest cliques in a graph

DOI10.1002/jgt.3190050206zbMath0467.05052OpenAlexW1972252235MaRDI QIDQ3919750

Alain Billionnet

Publication date: 1981

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

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

zbMATH Keywords

maximum clique

Mathematics Subject Classification ID

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

Related Items (2)

The maximum number of cliques in dense graphs ⋮ The maximum clique problem

This page was built for publication: An upper bound on the size of the largest cliques in a graph