论文信息 - An alternative proof for the constructive Asymmetric Lovász Local Lemma

An alternative proof for the constructive Asymmetric Lovász Local Lemma

We provide an alternative constructive proof of the Asymmetric Lov\'asz Local Lemma. Our proof uses the classic algorithmic framework of Moser and the analysis introduced by Giotis, Kirousis, Psaromiligkos, and Thilikos in "On the algorithmic Lov\'asz Local Lemma and acyclic edge coloring", combined with the work of Bender and Richmond on the multivariable Lagrange Inversion formula.

Dimitrios M. Thilikos | Lefteris M. Kirousis | Ioannis Giotis | Kostas I. Psaromiligkos

[1] Joel H. Spencer,et al. Asymptotic lower bounds for Ramsey functions , 1977, Discret. Math..

[2] Robin A. Moser. A constructive proof of the Lovász local lemma , 2008, STOC '09.

[3] Edward A. Bender,et al. A Multivariate Lagrange Inversion Formula for Asymptotic Calculations , 1998, Electron. J. Comb..

[4] Dimitrios M. Thilikos,et al. On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring , 2015, ANALCO.

[5] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[6] Gábor Tardos,et al. A constructive proof of the general lovász local lemma , 2009, JACM.