A note on near-optimal coloring of shift hypergraphs

DOI10.1002/rsa.20565zbMath1330.05067OpenAlexW2087365287MaRDI QIDQ3467579

Aravind Srinivasan, David G. Harris

Publication date: 3 February 2016

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

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

zbMATH Keywords

Lovász local lemmahypergraph coloringshift hypergraphs

Mathematics Subject Classification ID

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

Related Items (2)

Max-norm Ramsey theory ⋮ Polychromatic Colorings on the Integers

Cites Work

• Unnamed Item
• A constructive proof of the general lovász local lemma
• Approximating theDomatic Number
• Graph colouring and the probabilistic method

This page was built for publication: A note on near-optimal coloring of shift hypergraphs