A note on near-optimal coloring of shift hypergraphs

David G. Harris, Aravind Srinivasan. A note on near-optimal coloring of shift hypergraphs. Random Struct. Algorithms, 48(1):53-56, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.