The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\) (Q2920887)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\) |
scientific article; zbMATH DE number 6349031
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\) |
scientific article; zbMATH DE number 6349031 |
Statements
29 September 2014
0 references
linear space
0 references
chromatic number
0 references
hypergraph coloring
0 references
tabu search
0 references
0.8688819
0 references
0.8589308
0 references
0.8529692
0 references
0 references
0.8475394
0 references
0.8400911
0 references
0.8341392
0 references
The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\) (English)
0 references
