On the construction of 3-chromatic hypergraphs with few edges (Q2349182)
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 6447756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the construction of 3-chromatic hypergraphs with few edges |
scientific article; zbMATH DE number 6447756 |
Statements
On the construction of 3-chromatic hypergraphs with few edges (English)
0 references
19 June 2015
0 references
hypergraph
0 references
property B
0 references
constructive bound
0 references
extremal problem
0 references
0.8538119792938232
0 references
0.8532451391220093
0 references
0.8409191370010376
0 references
0.8294473886489868
0 references
0.8291153311729431
0 references
