Coloring \(d\)-embeddable \(k\)-uniform hypergraphs (Q5419987)
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 d-embeddable k-uniform hypergraphs |
scientific article; zbMATH DE number 6303009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring \(d\)-embeddable \(k\)-uniform hypergraphs |
scientific article; zbMATH DE number 6303009 |
Statements
11 June 2014
0 references
maximum chromatic number of hypergraphs
0 references
0.9927946925163268
0 references
0.7747195363044739
0 references
0.7704293131828308
0 references
0.7699212431907654
0 references
0.7690322399139404
0 references
