On the Problem of Erdős and Hajnal in the Case of List Colorings

DOI10.1016/j.endm.2009.07.064zbMath1273.05196OpenAlexW2092541351MaRDI QIDQ2851493

A. P. Rozovskaya, Dmitriy A. Shabanov

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.064

zbMATH Keywords

hypergraphuniform hypergraphchromatic numberlist chromatic numberextremal values

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Random coloring method in the combinatorial problem of Erdős and Lovász

Cites Work

• Hypergraphs with high chromatic number
• Greedy colorings of uniform hypergraphs
• Coloring uniform hypergraphs with few colors
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Problem of Erdős and Hajnal in the Case of List Colorings