Concentration of Non-Lipschitz Functions and Applications

Random Structures and Algorithms

Volumn 20, Issue 3, 2002, Pages 262-316

  Vu, V H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036099749     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10032     Document Type: Conference Paper

References (83)

1. h and h > 6 even, Ars Combinat 16 (1983), 103-111.
2. M. Ajtai, J. Komlós, and E. Szemerédi, A dense infinite Sidon sequence, Eur J Combinat 2 (1981), 1-11.
3. N. Alon, Restricted colorings of graphs, Survey in combinatorics, Proc 14th British Combinatorial Conf, London Mathematical Society Lecture Notes Series 187, K. Walker (Editor), Cambridge University Press, Cambridge, 1993, pp. 1-33.
4. N. Alon, B. Bollobás, J. H. Kim, and V. H. Vu, Economical covers and geometric applications, submitted.
5. N. Alon, J. H. Kim, and J. Spencer, Nearly perfect matching in regular simple hypergraphs, Isr J Math 100 (1997), 171-187.
6. N. Alon, M. Krivelevich, and Sudakov, List coloring of random and pseudo-random graphs, submitted.
7. N. Alon, M. Krivelevich, and Sudakov, Coloring graphs with sparse neighborhoods, JCT Ser B 77(1) (1999), 73-82.
8. N. Alon and J. Spencer, The probabilistic methods, 2nd edition, Wiley, New York, 2000.
9. S. Ball, On small complete arcs in a finite plane, Discrete Math 174(1-3) (1997), 29-34.
10. A. Blokhuis, Polynomials in finite geometry and combinatorics, Survey in combinatorics, London Mathematical Society Lecture Notes Series 187, K. Walker (Editor), Cambridge University Press, Cambridge, 1993, pp. 35-52.
11. B. Bollobás, Random graphs, Academic Press, London, 1985.
12. A. Brower, Block designs, Handbook of combinatorics, R. Graham, M. Grötschel, and L. Lovász (Editors), North-Holland, Amsterdam, 1995, Chap. 14.
13. 1/3 squares, Proc Am Math Soc 79 (1980), 203-205.
14. P. Dembowski, Finite geometries, Springer-Verlag, New York, 1968.
15. P. Erdos, Problems and results in additive number theory, Coll Théory de Nombre (CBRM), Bruxelles, 1956, pp. 127-137.
16. P. Erdos and H. Hanani, On a limit theorem in combinatorial analysis, Publ Math Debrecen 10 (1963), 10-13.
17. P. Erdos and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Infinite and finite sets, A. Hajnal et al. (Editors), North-Holland, Amsterdam, 1975, pp. 609-628.
18. P. Erdos and M. Nathanson, Largange's theorem and thin subsequences of squares, Contribution to probability, J. Gani and V. K. Rohatgi (Editors), Academic Press, New York, 1981, pp. 3-9.
19. P. Erdos and A. Rényi, Additive properties of random sequences of positive integers, Acta Arith 6 (1960), 83-110.
20. P. Erdos and A. Rényi, One the evolution of random graphs, Publ Math Inst Hung Acad Sci 5 (1960), 17-61.
21. P. Erdos and R. Rado, Intersection theorems for systems of sets, J London Math Soc 35 (1960), 85-90.
22. P. Erdos, A. L. Rubin, and H. Taylor, Choosability in graphs, Proc West Coast Conf Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI, 1979, pp. 125-157.
23. P. Erdos and P. Tetali, Representations of integers as sum of k terms, Random Struct Alg 1 (1990), 245-261.
24. P. Erdos and P. Turán, On a problem of Sidon in additive number theory and some related problems, J London Math Soc 16 (1941), 212-215.
25. P. Erdos, A. Sárközy, and T. Sós, Problems and results on additive properties of general sequences III, Stud Sci Math Hung 22 (1987), 53-63.
26. R. Faudree, A. Gyárfás, R. Schelp, and Zs. Tuza, The strong chromatic index of graphs, Ars Combinat 29-B (1990), 205-211.
27. P. Frankl and V. Rödl, Near perfect covering in graphs and hypergraphs, Eur J Combinat 6 (1985), 317-326.
28. A. Frieze, On small subgraphs of random graphs, Proc Random Graphs, Pozńan, 1989, pp. 67-90.
29. D. Grable, More than nearly perfect packings and partial designs, Combinatorica 19 (1999), 221-239.
30. D. Grable, Nearly perfect hypergraph packing in NC, Inform Process Lett 60 (1996), 295-299.
31. H. Halberstam and K. F. Roth, Sequences, Springer-Verlag, New York, 1983.
32. J. W. P. Hirschfeld, Projective geometries over finite fields, Claredon Press, Oxford, 1971.
33. S. Janson and A. Ruciński, The deletion method for upper tail estimates, preprint.
34. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
35. A. Johansson, An improved upper bound on the choice number for triangle free graphs, Technical report, Dimacs.
36. J. Kahn, One some hypergraph problems of P. Erdos and the asymptotics of matchings, covers and colorings, The mathematics of P. Erdos, R. Graham and J. Nesetril (Editors), Springer-Verlag, New York, 1997.
37. J. Kahn, Asymptotically good list-colorings, J Combinat Theory Ser A 73 (1996), 1-59.
38. J. H. Kim, On Brooks' theorem for sparse graphs, Combinat Probab Comput 4 (1995), 97-132.
39. 2/log t, Random Struct Alg 7 (1995), 173-207.
40. J. H. Kim and V. H. Vu, Concentration of multivariate polynomials and its applications, Combinatorica 20 (2000), 417-434.
41. J. H. Kim and V. H. Vu, Small complete arcs in projective planes, submitted, http://www.math.ucsd.edu/vanvu/.
42. G. Korchmáros, New example of complete k-arcs in PG(2, q), Eur J Combinat 4 (1983), 329-334.
43. A. Kostochka and V. Rödl, Partial Steiner systems and matchings in hypergraphs, Random Struct Alg 13 (1997), 335-347.
44. M. Krivelevich, The choice number of dense random graphs, Combinat Probab Comput 9 (2000), 19-26.
45. M. Krivelevich and V. H. Vu, The weak choice number of random hypergraphs, J Combinat Theory Ser B, to appear.
46. M. Krivelevich, B. Sudakov, V. H. Vu, and N. Wormald, Random regular graphs of high degree, Random Struct Alg 18 (2001), 346-363.
47. 2,q, Boll Un Mat It 11 (1956), 178-181.
48. q archi, Ist Lombardo Accad Sci Rend A 98 (1964), 3-52.
49. M. Madhian, The strong chromatic index of graphs, M.Sc. Thesis, Department of Computer Science, Toronto University, 2000.
50. C. McDiarmid, Concentration, Probabilistic method for algorithmic discrete mathematics, M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed (Editors), Springer-Verlag, New York, 1997, pp. 195-248.
51. M. Molloy and B. Reed, A bound on the strong chromatic index of a graph, J Combinat Theorey, Series B, 69, 1997, no 2, 103-109.
52. M. Molloy and B. Reed, A bound on the total chromatic number, Combinatorica 18 (1998), 241-280.
53. M. Nathanson, Waring's problem for sets of density zero, Analitic number theory, M. Knopp (Editor), Lecture Notes in Mathematics 899, Springer-Verlag, New York, 1980, pp. 302-310.
54. N. Pippenger, unpublished.
55. N. Pippenger and J. H. Spencer, Asymptotic behaviour of the chromatic index for hypergraphs, J Combinat Theory Ser A 51 (1989), 24-42.
56. V. Rödl, On a packing and covering problem, Eur J Combinat 5 (1985), 69-78.
57. A. Ruciński, When are small subgraphs of a random graph normally distributed?, Probab Related Fields 78 (1988), 1-10.
58. R. Schoof, Non-singular plane cubic curve s over finite fields, J Combinat Theory Ser A 46 (1987), 183-211.
59. B. Segre, Le geometrie di Galois, Ann Mat Pura Appl 48 (1959), 1-97.
60. B. Segre, Introduction to Galos geometries (ed. J. W. P. Hirschfeld), Mem Accad Naz Lincei 8 (1967), 133-263.
61. S. Shelah and J. Spencer, Zero-one law for sparse random graphs, J Am Math Soc 1 (1988), 97-115.
62. J. Spencer, Counting extensions, J Combinat Theory Ser A 55 (1990), 247-255.
63. J. Spencer, Four squares with few squares, Number theory, New York Seminar 1991-1995, D. V. Chudnovsky et al. (Editors), Springer-Verlag, New York, 1996, pp. 295-297.
64. M. Steel, Probability theory and combinatorial optimization, Conference Board of the Mathematical Sciences 69, Philadelphia, 1997.
65. T. Szonyi, Complete arcs in PG(2, q), Quad Sem Geom Comb Univ Roma ("La Sapienza"), 94 (1989), 15-29.
66. T. Szonyi, Arcs, caps, codes and 3-independent subsets, Giornate di geometrie combinatoire, G. Faina and G. Tallini (Editors), Università di Perrugia, 1993, pp. 57-80.
67. M. Talagrand, A new look at independence, Ann Probab 24 (1996), 1-34.
68. M. Talagrand, Concentration of measures and isoperimetric inequalities in product spaces, Publ Math IHES 81 (1996), 73-205.
69. Z. Tuza, Graph coloring with local constrains - a survey, Discuss Math Graph Theory 17(2) (1997), 161-228.
70. R. C. Vaughan, The Hardy-Littlewood method, Cambridge University Press, Cambridge, 1981.
71. V. G. Vizing, Coloring the vertices of a graph in prescribed colors (in Russian), Diskret Anal No. 29, Met Diskret Anal Teor Kodov Shem 101 (1976), 3-10.
72. J. F. Voloch, On the completeness of certain plane arcs II, Eur J Combinat 11 (1990), 491-496.
73. J. F. Voloch, Complete arcs in Galois planes of non-square order, Advance in finite geometries and designs, J. W. P. Hirschfeld, D. R. Huges, and J. A. Thas (Editors), Oxford University Press, Oxford, 1991, pp. 401-406.
74. V. H. Vu, On some degree conditions which guarantee the upper bound of chromatic (choice) number of random graphs, J Graph Theory 31 (1999), 201-226.
75. V. H. Vu, On the choice number of random hypergraphs, Combinat Probab Comput 9 (2000), 79-95.
76. V. H. Vu, A large deviation result on the number of small subgraphs of a random graph, Combinat Probab Comput, to appear, http://www.math.ucsd.edu/vanvu/.
77. V. H. Vu, On a refinement of Waring's problem, Duke Math J 105 (2000), 107-134.
78. V. H. Vu, On the concentration of multivariate polynomials with small expectation, Random Struct Alg 16 (2000), 344-363.
79. V. H. Vu, New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help, Random Struct Alg 17 (2000), 29-63.
80. V. H. Vu, On the list chromatic number of locally sparse graphs, Combinat Probab Comput, to appear, http://www.math.ucsd.edu/vanvu/.
81. E. Wirsing, Thin subbases, Analysis 6 (1986), 285-308.
82. J. Zöllner, Der Vier-Quadrate-Satz und ein Problem von Erdos and Nathanson, Ph.D thesis, Johannes Gutenberg-Universität, Mainz, 1984.
83. J. Zöllner, Über eine Vermutung von Choi, Erdös and Nathanson, Acta Arith 45 (1985), 211-213.