On the power of random greedy algorithms
EUROPEAN JOURNAL OF COMBINATORICS(2022)
摘要
In this paper we solve two problems of Esperet, Kang and Thomasse as well as Li concerning (i) induced bipartite sub graphs 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. (C) 2022 Published by Elsevier Ltd.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要