Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069)
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: Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz |
scientific article |
Statements
Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (English)
0 references
31 August 2022
0 references
coloring
0 references
hypergraphs
0 references
Erdős-Faber-Lovász conjecture
0 references
combinatorial nullstellensatz
0 references
graph orientations
0 references
0 references
0.8740020990371704
0 references
0.8622634410858154
0 references
0.8463963270187378
0 references
0.8378614783287048
0 references
0.8369758129119873
0 references
