Clique covering of graphs (Q1100482): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q520379 |
||
| Property / author | |||
| Property / author: László Pyber / rank | |||
Revision as of 23:12, 15 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Clique covering of graphs |
scientific article |
Statements
Clique covering of graphs (English)
0 references
1986
0 references
The clique covering number cc(G) of a graph G is the least number of complete subgraphs of G necessary to cover the edge set of G. The author shows that there exists an integer \(n_ 0\) such that for all graphs G on \(n>n_ 0\) vertices \(\max \{cc(G)+cc(\bar G)\}=\lfloor n^ 2/4\rfloor +2.\) This settles a conjecture of Erdős.
0 references
clique covering number
0 references
