A note on the random greedy independent set algorithm

Patrick Bennett, Tom Bohman

Let $r\ge 3$ be a fixed constant and let $\mathcal{H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $D>N^{\epsilon }$ for some $ \varepsilon…