An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three (Q1306277)
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: An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three |
scientific article; zbMATH DE number 1346913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three |
scientific article; zbMATH DE number 1346913 |
Statements
An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three (English)
0 references
4 October 1999
0 references
colouring
0 references
bound
0 references
chromatic number
0 references
uniform hypergraph
0 references
cycles
0 references
chromatic polynomial
0 references
0.8519657254219055
0 references
0.8356884717941284
0 references
0.8336288332939148
0 references
