Clique covering of graphs (Q1100482)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4043874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique covering of graphs |
scientific article; zbMATH DE number 4043874 |
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
0.8959732055664062
0 references
0.8520494103431702
0 references
0.8459690809249878
0 references
