On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On a property of families of sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5724800 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a combinatorial problem. II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5477816 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved bounds and algorithms for hypergraph 2-coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraphs with high chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring uniform hypergraphs with few colors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Greedy colorings of uniform hypergraphs / rank | |||
Normal rank |
Latest revision as of 22:23, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Problem of Erdős and Hajnal in the Case of List Colorings |
scientific article |
Statements
On the Problem of Erdős and Hajnal in the Case of List Colorings (English)
0 references
10 October 2013
0 references
hypergraph
0 references
uniform hypergraph
0 references
chromatic number
0 references
list chromatic number
0 references
extremal values
0 references