Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522)
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 7963990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree |
scientific article; zbMATH DE number 7963990 |
Statements
Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (English)
0 references
9 January 2025
0 references
Erdős-Faber-Lovász conjecture
0 references
edge-colouring hypergraphs with bounded codegree
0 references
0 references
0.8455680012702942
0 references
0.8393181562423706
0 references
0.8237110376358032
0 references
0.8215523958206177
0 references
