𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal clique coverings of complementary graphs

✍ Scribed by D. de Caen; P. Erdős; N. J. Pullmann; N. C. Wormald

Book ID
110564304
Publisher
Springer-Verlag
Year
1986
Tongue
English
Weight
264 KB
Volume
6
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Extremal graphs for intersecting cliques
Extremal graphs for intersecting cliques
✍ Guantao Chen; Ronald J. Gould; Florian Pfender; Bing Wei 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 156 KB
Covering all cliques of a graph
Covering all cliques of a graph
✍ Zsolt Tuza 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 701 KB

The following conjecture of T. Gallai is proved: If G is a chordal graph on n vertices, such that all its maximal complete subgraphs have order at least 3, then there is a vertex set of cardinality ~n/3 which meets all maximal complete subgraphs of G. Further related results are given.