Coloring non-uniform hypergraphs without short cycles (Q742641): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-013-1333-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008743411 / rank | |||
Normal rank | |||
Revision as of 18:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring non-uniform hypergraphs without short cycles |
scientific article |
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
