A note on near-optimal coloring of shift hypergraphs

DOI10.1002/RSA.20565zbMATH Open1330.05067OpenAlexW2087365287MaRDI QIDQ3467579FDOQ3467579

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

Recommendations

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

zbMATH Keywords

hypergraph coloringLovász local lemmashift hypergraphs

Mathematics Subject Classification ID

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

Cites Work

• Graph colouring and the probabilistic method
• Approximating theDomatic Number
• A constructive proof of the general Lovász local lemma
• Title not available (Why is that?)

Cited In (3)

• Max-norm Ramsey theory
• Polychromatic colorings on the integers
• Title not available (Why is that?)

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)