Erdős–Faber–Lovász conjecture
GPTKB entity
Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Faber–Lovász conjecture
|
| gptkbp:namedAfter |
gptkb:Vera_T._Sós
gptkb:Paul_Erdős gptkb:László_Lovász |
| gptkbp:proposedBy |
gptkb:Vera_T._Sós
gptkb:Paul_Erdős gptkb:László_Lovász |
| gptkbp:provenBy |
gptkb:Tom_Kelly
gptkb:Benny_Sudakov gptkb:Abhishek_Methuku gptkb:Daniela_Kühn gptkb:Deryk_Osthus gptkb:Dong_Yeap_Kang gptkb:Jacques_Verstraëte |
| gptkbp:relatedTo |
chromatic index
linear hypergraph |
| gptkbp:sentence |
The chromatic index of any linear hypergraph with n vertices and n edges is at most n.
|
| gptkbp:status |
proved
|
| gptkbp:topic |
hypergraph coloring
|
| gptkbp:yearProposed |
1972
|
| gptkbp:yearProved |
2021
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
4
|