A note on Erdős-Faber-Lovász conjecture and edge coloring of complete graphs. (Q2978308)
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 6707364
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on Erdős-Faber-Lovász conjecture and edge coloring of complete graphs. |
scientific article; zbMATH DE number 6707364 |
Statements
21 April 2017
0 references
Erdős-Faber-Lovász conjecture
0 references
intersecting hypergraph
0 references
\(n\)-quasicluster
0 references
chromatic number
0 references
0.8615494966506958
0 references
0.8581000566482544
0 references
0.8572679758071899
0 references
0.8514492511749268
0 references
0.8471240401268005
0 references
