Coloring uniform hypergraphs with few edges (Q3055779): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q85548126, #quickstatements; #temporary_batch_1712272666262 |
Created claim: DBLP publication ID (P1635): journals/rsa/KostochkaK09, #quickstatements; #temporary_batch_1731461124002 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A remark concerning arithmetic progressions / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/rsa/KostochkaK09 / rank | |||
Normal rank | |||
Latest revision as of 02:47, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring uniform hypergraphs with few edges |
scientific article |
Statements
Coloring uniform hypergraphs with few edges (English)
0 references
9 November 2010
0 references
hypergraph coloring
0 references
maximum degree
0 references
edge-degree
0 references
small size
0 references
