Concentration of multivariate polynomials and its applications

Combinatorica

Volumn 20, Issue 3, 2000, Pages 417-434

  Kim, Jeong Han ^a   Vu, Van H ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040735835     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070014     Document Type: Article

References (23)

1. N. ALON, M. KRIVELEVICH and SUDAKOV: Coloring graphs with sparse neighborhoods, submitted.
2. N. ALON and J. SPENCER: The Probabilistic Method, Wiley, New York, 1992.
3. B. BOLLOBÁS: Random Graphs, Academic Press, London, 1985.
4. P. ERDOS, A. L. RUBIN and H. TAYLOR: Choosability in graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI (1979) 125-157.
5. D. GRABLE: A large deviation inequality for functions of independent, multi-way choices, Combinatorics, Probability and Computing (1998) 7, 57-63.
6. A. JOHANSSON: Asymptotic choice number for triangle free graphs, DIMACS Technical Report (1996).
7. S. JANSON, T. ŁUCZAK and A. RUCIŃSKI: An exponential bound for the probability of nonexistence of a specified subgraph in a random graph, in: Random Graphs '87 (M. Karoński et al. eds.), Wiley, New York, 1990, 73-87.
8. J. H. KIM: On Brooks' theorem for sparse graphs, Combinatorics, Probability and Computing 4 (1995), 97-132.
9. J. H. KIM and V. H. VU: Small complete arcs on finite projective planes, submitted.
10. B. SEGRE: Le geometrie de Galois, Ann. Mat. Pura Appl. (1959) 48, 1-97.
11. B. SEGRE: Introduction to Galois geometries (J. W. P. Hirschfeld ed.), Mem. Accad. Naz. Lincei, 8 (1967), 133-263.
12. S. SHELAH and J. SPENCER: Zero-one laws for sparse random graphs, J. Amer. Math. Soc., 1 (1988), 97-115.
13. J. SPENCER: Counting extensions, J. Combin. Theory Ser. A, 55 (1990), 247-255.
14. T. SZONYI: Complete arcs in PG(2,q), a survey, in: Quad. del Sem. Geom. Comb. Univ. di Roma ("La Sapienza"), 94 (1989).
15. V. H. VU: On some simple degree conditions which guarantee the upper bound on the chromatic (choice) number of random graphs, Journal of Graph Theory, 31 (1999), no. 3, 201-226.
16. V. H. VU: On the list chromatic number of locally sparse graphs, preprint.
17. V. H. VU: On the concentration of multivariate polynomials with small expectation, submitted.
18. V. H. VU: Some new concentration results and applications, preprint.
19. V. H. VU: On the refinement of Waring's problem, to appear in Duke Math. Journal.
20. V. H. VU: On nearly perfect matchings in hypergraphs, to appear in Random Structures and Algorithms.
21. C. MCDIARMID: On the method of bounded differences, in: Surveys in Combinatorics, (ed.: J. Siemons), London Math. Society Lecture Note Series 141, Cambridge University Press, 1989.
22. V. G. VIZING: Coloring the vertices of a graph with perscribed colors, Diskret Analiz, 29, Metody Diskret Anal v Teorii Kodov i Shem, 101 (1976), 3-10.
23. V. G. VIZING: Coloring the vertices of a graph with perscribed colors, Diskret Analiz, 29, Metody Diskret Anal v Teorii Kodov i Shem, 101 (1976), 3-10.