A coloring problem related to the Erdős, Faber, Lovasz conjecture (Q1117945): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56390945, #quickstatements; #temporary_batch_1706327624897 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56390945 / rank | |||
Normal rank |
Revision as of 05:57, 27 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A coloring problem related to the Erdős, Faber, Lovasz conjecture |
scientific article |
Statements
A coloring problem related to the Erdős, Faber, Lovasz conjecture (English)
0 references
1990
0 references
The famous conjecture of Erdős, Faber and Lovasz states that if the edge set of a graph G can be covered with n copies of the complete graph on vertices such that any two of those share at most one vertex, then the chromatic number of G is just n. In the paper it is shown that the chromatic number of any graph whose edge set can be covered with n copies of the complete graph on n vertices (intersection of any two of them is not restricted) is at most \(n^{3/2}\), and this bound is asymptotically best possible.
0 references
chromatic number
0 references