A Large Deviation Result on the Number of Small Subgraphs of a Random Graph

Combinatorics Probability and Computing

Volumn 10, Issue 1, 2001, Pages 79-94

  Vu, Van H ^a,b  

^a MICROSOFT RESEARCH   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035595391     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0963548300004545     Document Type: Article

References (19)

1. Alon, N. (1981) On the number of subgraphs of prescribed type of graphs with a given number of edges. Israel J. Math. 38 116-130.
2. Alon, N. and Spencer J. (1992) The Probabilistic Method, Wiley.
3. Bollobás, B. (1981) The threshold functions for small subgraphs. Math. Proc. Cambridge Philos. Soc. 90 197-206.
4. Bollobás, B. (1985) Random Graphs, Academic Press, London.
5. Erdos, P. and Rényi A. (1960) On the evolution of random graphs. Publ. Math. Inst. Hungarian Acad. Sci. 5 17-61.
6. Frieze, A. (1989) On small subgraphs of random graphs. In Proceedings of Random Graphs 1989, Pozńan, pp. 67-90.
7. Janson, S. (1990) Poisson approximation for large deviations. Random Structures and Algorithms 1 221-230.
8. Janson, S. (1994) Orthogonal decompositions and functional limit theorems for random graph statistics. Mem. Amer. Math. Soc. 111 no. 534.
9. Janson, S., Łuczak, T. and Ruciński, A. (1987) An exponential bound on the nonexistence of a specified subgraph in a random graph. In Random Graphs '87, Wiley, New York, pp. 73-87.
10. Janson, S., Łuczak T. and Ruciński, A. (2000) Random Graphs, Wiley.
11. Karoński, M. (1995) Handbook of Combinatorics, Chapter 6, North-Holland.
12. Karoński, M. and Ruciński, A. (1983) On the number of strictly balanced subgraphs of a random graph. In Graph Theory, Lagów 1981, Vol. 1018 of Lecture Notes in Mathematics, Springer, Berlin, pp. 79-83.
13. Kim, J. H. and Vu, V (2000) Concentration of multivariate polynomials and applications. Combinatorica 20 417-434.
14. Krivelevich, M. and Vu, V. Some large deviation results on the few largest eigenvalues of random matrices. Submitted.
15. Ruciński, A. (1988) When are small subgraphs of a random graph normally distributed? Probab. Rel. Fields 78 1-10.
16. Ruciński, A. (1987) Small subgraphs of a random graph: A survey. In Random Graphs '87, Wiley, New York, pp. 283-303.
17. Schürger, K. (1979) Limit theorems for complete subgraphs of random graphs. Per. Math. Hungar. 10 47-53.
18. Shelah, S. and Spencer, S. (1988) Zero-one law for sparse random graphs. J. Amer. Math. Soc. 1 97-115.
19. Spencer, J. (1990) Counting extensions. J. Combin. Theory Ser. A 55 247-255.