A note on near-optimal coloring of shift hypergraphs

DOI10.1002/RSA.20565MaRDI QIDQ3467579zbMATH OpenOpenAlexFDO

Authors David G. Harris, Aravind Srinivasan

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

hypergraph coloringLovász local lemmashift hypergraphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 881158
• scientific article; zbMATH DE number 1445282
• Hypergraph colouring and the Lovász local lemma
• A general framework for hypergraph coloring
• Coloring and the Lovász local lemma

Cites work

• scientific article; zbMATH DE number 881158 (Why is no real title available?)
• A constructive proof of the general Lovász local lemma
• Approximating theDomatic Number
• Graph colouring and the probabilistic method

Cited in

(3)

• scientific article; zbMATH DE number 881158 (Why is no real title available?)
• Max-norm Ramsey theory
• Polychromatic colorings on the integers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3467579)