Divide and conquer martingales and the number of triangles in a random graph

Random Structures and Algorithms

Volumn 24, Issue 2, 2004, Pages 166-174

  Kim, J H ^a   Vu, V H ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2542554995     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10113     Document Type: Article

References (16)

1. N. Alon, J. H. Kim, and J. Spencer, Nearly perfect matchings in regular simple hypergraphs, Israel J Math 100 (1997), 171-187.
2. B. Bollobás, Random graphs, Academic Press, New York, 1985.
3. D. Grable, A large deviation inequality for functions of independent, multi-way choices, Combin Probab Comput 7(1) (1998), 57-63.
4. A. Godbole and P. Hitczenko, "Beyond the method of bounded differences," Microsurveys in discrete probability, Princeton, NJ, 1997, DIMACS Ser Discrete Math Theoret Comput Sci 41, 43-58. American Mathematical Society, Providence, RI, 1998.
5. S. Janson and A. Ruciński, The infamous upper tail. Probabilistic methods in combinatorial optimization. Random Structures Algorithms 20(3) (2002), 317-342.
6. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
7. S. Janson, K. Oleszkiewicz, and A. Ruciński, Upper tails for subgraph counts in random graphs, Israel J Math, to appear.
8. J. Kahn, Asymptotically good list-colorings, J Combin Theory Ser A 73 (1996), 1-59.
9. J. H. Kim, On Brooks' theorem for sparse graphs, Combin Probab Comput 4 (1995), 97-132.
10. J. H. Kim and V. H. Vu, Concentration of multi-variate polynomials and its applications, Combinatorica 20(3) (2000), 417-434.
11. J. H. Kim and V. H. Vu, Small complete arcs in projective planes, Combinatorica, to appear.
12. C. McDiarmid, "On the method of bounded differences," Surveys in combinatorics, 1989, Norwich, London Math Soc Lecture Note Ser 141, 148-188. Cambridge University Press, Cambridge, 1989.
13. n,p', Combinatorica 7(1) (1987), 121-129.
14. V. H. Vu, On the concentration of multi-variate polynomials with small expectation, Random Structures Algorithms 16(4) (2000), 344-363.
15. V. H. Vu, Concentration of non-Lipschitz functions and applications, Random Structures Algorithms 20(3) (2002), 262-316.
16. V. H. Vu, A large deviation result on the number of small subgraphs of a random graph, Combin Probab Comput 10(1) (2001), 79-94.