Coloring uniform hypergraphs with few colors
From MaRDI portal
Publication:4446874
DOI10.1002/rsa.10109zbMath1031.05051MaRDI QIDQ4446874
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
Related Items
Extremal problems in hypergraph colourings, Lower bounds for the number of edges in hypergraphs of certain classes, On \(r\)-chromatic hypergraphs, 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, On proper colorings of hypergraphs, Equitable colorings of hypergraphs with \(r\) colors, On the Problem of Erdős and Hajnal in the Case of List Colorings, Greedy colorings of uniform hypergraphs, On proper colourings of hypergraphs using prescribed colours, Random coloring method in the combinatorial problem of Erdős and Lovász, A note on random greedy coloring of uniform hypergraphs