Maximum number of colors in hypertrees of bounded degree (Q302137)
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 6600680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum number of colors in hypertrees of bounded degree |
scientific article; zbMATH DE number 6600680 |
Statements
Maximum number of colors in hypertrees of bounded degree (English)
0 references
4 July 2016
0 references
hypergraph
0 references
hypertree
0 references
arboreal hypergraph
0 references
vertex coloring
0 references
C-coloring
0 references
upper chromatic number
0 references
0.8726478815078735
0 references
0.8180813193321228
0 references
0.8116415143013
0 references
