𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of dense arrangements

✍ Scribed by J Glaz


Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
166 KB
Volume
27
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The maximum number of cliques in dense g
✍ Bruce Hedman πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 372 KB

Denote the number of vertices of G by ]G[. A clique of graph G is a maximal complete subgraph. The density oJ(G) is the number of vertices in the largest clique of G. If Β’o(G)>~Β½ ]GI, then G has at most 2 tΒ°l-'cG) cliques. The extremal graphs are then examined as wen. ## Terminology We will be co