Preprint
Aug 2026
Tight Inapproximability of Max Independent Set in Triangle-Free Graphs
The soundness uses a result of Haeupler, Saha, and Srinivasan building on the proof of Moser and Tardos, to upper-bound the probability that a fixed relatively large subset is an independent set after the Moser-Tardos algorithm terminates.
Édouard Bonnet
· 0 citations