The de Bruijn-Erdős theorem for hypergraphs (Q690671)
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 de Bruijn-Erdős theorem for hypergraphs |
scientific article; zbMATH DE number 6110836
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The de Bruijn-Erdős theorem for hypergraphs |
scientific article; zbMATH DE number 6110836 |
Statements
The de Bruijn-Erdős theorem for hypergraphs (English)
0 references
28 November 2012
0 references
Zarankiewicz problem
0 references
minimum size of a clique partition
0 references
0.7931998372077942
0 references
0.7883687019348145
0 references
0.7794235944747925
0 references
0.7772492170333862
0 references
