✦ LIBER ✦

On the Maximum Number of Cliques in a Graph

✍ Scribed by David R. Wood

Publisher: Springer Japan
Year: 2007
Tongue: English
Weight: 192 KB
Volume: 23
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0738-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum number of cliques in dense g

The maximum number of cliques in dense graphs

✍ 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

The maximum number of q-cliques in a gra

The maximum number of q-cliques in a graph with no p-clique

✍ Steven Roman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 805 KB

An upper bound on the number of cliques

An upper bound on the number of cliques in a graph

✍ Martin Farber; Mihály Hujter; Zsolt Tuza 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 1 views

The Clique Numbers of Regular Graphs

✍ Narong Punnim 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 84 KB

Variations of maximum-clique transversal

Variations of maximum-clique transversal sets on graphs

✍ Chuan-Min Lee 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 882 KB

On the maximum number of cycles in a pla

On the maximum number of cycles in a planar graph

✍ R. E. L. Aldred; Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

## Abstract Let __G__ be a graph on __p__ vertices with __q__ edges and let __r__ = __q__ − __p__ = 1. We show that __G__ has at most ${15\over 16} 2^{r}$ cycles. We also show that if __G__ is planar, then __G__ has at most 2^__r__ − 1^ = __o__(2^__r__ − 1^) cycles. The planar result is best possib