Coloring non-uniform hypergraphs without short cycles (Q742641)
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 non-uniform hypergraphs without short cycles |
scientific article; zbMATH DE number 6346047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring non-uniform hypergraphs without short cycles |
scientific article; zbMATH DE number 6346047 |
Statements
Coloring non-uniform hypergraphs without short cycles (English)
0 references
19 September 2014
0 references
non-uniform hypergraphs
0 references
chromatic number
0 references
Erdős-Lovász problem
0 references
hypergraphs with large girth
0 references
0.972754955291748
0 references
0.8915629982948303
0 references
0.8914840221405029
0 references
0.8862177729606628
0 references
