𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal graphs for intersecting cliques

✍ Scribed by Guantao Chen; Ronald J. Gould; Florian Pfender; Bing Wei

Book ID
108395404
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
156 KB
Volume
89
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal Graphs for Intersecting Triangl
Extremal Graphs for Intersecting Triangles
✍ P. Erdos; Z. Furedi; R.J. Gould; D.S. Gunderson πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 400 KB

It is known that for a graph on \(n\) vertices \(\left\lfloor n^{2} / 4\right\rfloor+1\) edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of \(k\) triangles intersecting in exactly one common vertex. C 1995

On clique-extremal (p,q)-graphs
On clique-extremal (p,q)-graphs
✍ F. Harary; A. Lempel πŸ“‚ Article πŸ“… 1974 πŸ› John Wiley and Sons 🌐 English βš– 346 KB

## Abstract A clique of a graph is a maximal complete subgraph. A (p,q)‐graph has p points and q lines. A clique‐extremal (p,q)‐graph has either the maximum or the minimum number of cliques among all (p,q)‐graphs. Moon and Moser have determined constructively the maximum number of cliques in a p‐po