A coloring problem related to the Erdős, Faber, Lovasz conjecture (Q1117945): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Peter Horák / rank | |||
Property / reviewed by | |||
Property / reviewed by: Peter Horák / rank | |||
Property / author | |||
Property / author: Peter Horák / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Peter Horák / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the combinatorial problems which I would most like to see solved / rank | |||
Normal rank |
Revision as of 14:41, 19 June 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