Clique covering of graphs (Q1100482): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: László Pyber / rank | |||
| Property / author | |||
| Property / author: László Pyber / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremal clique coverings of complementary graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Representation of a Graph by Set Intersections / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3313890 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579265 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2017711450 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:25, 30 July 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
