On the power of random greedy algorithms
arXiv:2104.07854 · doi:10.1016/j.ejc.2022.103551
Abstract
In this paper we solve two problems of Esperet, Kang and Thomasse as well as Li concerning (i) induced bipartite subgraphs in triangle-free graphs and (ii) van der Waerden numbers. Each time random greedy algorithms allow us to go beyond the Lovasz Local Lemma or alteration method used in previous work, illustrating the power of the algorithmic approach to the probabilistic method.
14 pages; minor edits; to appear in European Journal of Combinatorics