Funder
National Science Foundation
Reference43 articles.
1. Local max-cut in smoothed polynomial time;Angel,2017
2. Percolation on finite graphs and isoperimetric inequalities;Alon;Ann. Probab.,2004
3. On percolation and NP-hardness;Bennett;Random Struct. Algorithms,2019
4. Dirac's map-color theorem for choosability;Böhme;J. Graph Theory,1999
5. Random Graphs;Bollobás,2011