A note on near-optimal coloring of shift hypergraphsOpen Website

2016 (modified: 26 May 2021)Random Struct. Algorithms 2016Readers: Everyone
Abstract: As shown in the original work on the Lovász Local Lemma due to Erdős & Lovász (Infinite and Finite Sets, 1975), a basic application of the Local Lemma answers an infinitary coloring question of Strau...
0 Replies

Loading