𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clique coverings of the edges of a random graph

✍ Scribed by Béla Bollobás; Paul Erdős; Joel Spencer; Douglas B. West

Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
293 KB
Volume
13
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Covering the cliques of a graph with ver
Covering the cliques of a graph with vertices
✍ Paul Erdős; Tibor Gallai; Zsolt Tuza 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 681 KB

The following problem is investigated. Given an undirected graph G, determine the smallest cardinality of a vertex set that meets all complete subgraphs KC G maximal under inclusion.