Coloring uniform hypergraphs with few colors

DOI10.1002/rsa.10109zbMath1031.05051OpenAlexW1976087213MaRDI QIDQ4446874

Alexandr V. Kostochka

Publication date: 3 February 2004

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10109

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

A note on random greedy coloring of uniform hypergraphs ⋮ Equitable colorings of hypergraphs with \(r\) colors ⋮ On proper colorings of hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Lower bounds for the number of edges in hypergraphs of certain classes ⋮ On \(r\)-chromatic hypergraphs ⋮ Greedy colorings of uniform hypergraphs ⋮ On proper colourings of hypergraphs using prescribed colours ⋮ Improvement of the lower bound in the Erdös-Hajnal combinatorial problem ⋮ Coloring non-uniform hypergraphs without short cycles ⋮ On the chromatic number of simple triangle-free triple systems ⋮ On the chromatic number of finite systems of subsets ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász ⋮ On the Problem of Erdős and Hajnal in the Case of List Colorings