×

zbMATH — the first resource for mathematics

An upper bound on the size of the largest cliques in a graph. (English) Zbl 0467.05052

MSC:
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C35 Extremal problems in graph theory
Keywords:
maximum clique
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Graphes et Hypergraphes. Dunod, Paris (1970).
[2] An algorithm for the vertex packing problem. Communication at the Tenth International Symposium on Mathematical Programming, Montreal, 27–31 August, 1979.
[3] Geoffroy, J. Graph Theory 2 pp 223– (1978)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.