On smoothed analysis in dense graphs and formulas

Random Structures and Algorithms

Volumn 29, Issue 2, 2006, Pages 180-193

  Krivelevich, Michael ^a   Sudakov, Benny ^b   Tetali, Prasad ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b PRINCETON UNIVERSITY   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748437354     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20097     Document Type: Article

References (17)

1. k log 2 - O(k), Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 223-231.
2. N. Alon and J. Spencer, The Probabilistic Method, 2nd ed., Wiley, New York, 2000.
3. T. Bohman, A. Frieze, and R. Martin, How many random edges make a dense graph Hamiltonian? Random Struct Algor 22 (2003), 33-42.
4. T. Bohman, A. Frieze, M. Krivelevich, and R. Martin, Adding random edges to dense graphs, Random Struct Algor 24 (2004), 105-117.
5. B. Bollobás, Random graphs, In Combinatorics, Proceedings, Swansea 1981, London Math. Soc. Lecture Note Ser. 52, Cambridge University Press, Cambridge, 1981, pp. 80-102.
6. B. Bollobás, Random graphs, 2nd ed., Cambridge Studies in Advanced Mathematics, 73, Cambridge University Press, Cambridge, 2001.
7. V. Chvátal and B. Reed, Mick gets some (the odds are on his side), Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 620-627.
8. S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.
9. P. Erdos and A. Rényi, On the evolution of random graphs, Publ Math Inst Hungar Acad Sci 5 (1960), 17-61.
10. A. Goerdt, A threshold for unsatisfiability, Proceedings of the 17th International Symposium of Mathematical Foundations of Computer Science, Springer LNCS 629, 1992, pp. 264-275.
11. S. Janson, T. Luczak, and A. Ruciński, Random Graphs, Wiley, New York, 2000.
12. Y. Kohayakawa and B. Kreuter, Threshold functions for asymmetric Ramsey properties involving cycles, Random Struct Algor 11 (1997), 245-276.
13. V. Rödl and A. Ruciński, Random graphs with monochromatic triangles in every edge coloring, Random Struct Algor 5 (1994), 253-270.
14. V. Rödl and A. Rucin̈ski, Threshold functions for Ramsey properties, J Am Math Soc 8 (1995), 917-942.
15. D. A. Spielman and S.-H. Teng, Why the simplex algorithm usually takes polynomial time, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 296-305.
16. B. Sudakov and J. Vondrak, How many random edges make a dense hypergraph non-2-colorable?, (2005), preprint.
17. E. Szemerédi, Regular partitions of graphs, Colloques Internationaux C.N.R.S. No. 260, Problèmes Combinatoires et Théorie des Graphes, Orsay, 1976, pp. 399-401.