- Divide and Conquer martingales and the number of triangles in a random graph
- Economical covers with geometric applications Bela Bollobas
- Discrepancy after adding a single set Jeong Han Kim
- Small complete arcs in projective planes January 13, 2003
- A LARGE DEVIATION RESULT ON THE NUMBER OF SMALL SUBGRAPHS OF A RANDOM GRAPH
- Choosability in random hypergraphs Michael Krivelevich
- Finite and Infinite Arithmetic Progressions in Sumsets E. Szemeredi
- Anti-Hadamard matrices, coin weighing, threshold gates and indecomposable hypergraphs
- The cover time, the blanket time, and the Matthews bound L. Lovasz
- Extremal set systems with weakly restricted intersections September 6, 2001
- Long arithmetic progressions in sum-sets and the number of x-sum-free sets
- On the asymmetry of random regular graphs and random graphs Jeong Han Kim
- High order complementary bases of primes March 24, 2002
- CONCENTRATION OF MULTIVARIATE POLYNOMIALS AND ITS APPLICATIONS
- On some simple degree conditions which guarantee the upper bound on the chromatic (choice) number of random graphs
- Classification: Physical Sciences, Mathematics The spectra of random graphs with given expected degrees
- On the probability of independent sets in random graphs Michael Krivelevich
- INVERSE LITTLEWOOD-OFFORD THEOREMS AND THE CONDITION NUMBER OF RANDOM DISCRETE MATRICES
- RANDOM INSCRIBING POLYTOPES ROSS M. RICHARDSON, VAN H. VU, AND LEI WU
- CENTRAL LIMIT THEOREMS FOR GAUSSIAN POLYTOPES IMRE BARANY AND VAN VU
- Sandwiching random graphs January 13, 2003
- Covering codes with improved density Michael Krivelevich
- Chernoff type bounds for sum of dependent random variables and applications in additive
- On a question of Gowers We show that any subset of density 100
- Concentration of non-Lipschitz functions and applications October 19, 2001
- On the concentration of eigenvalues of random symmetric matrices Michael Krivelevich
- Approximating the independence number and the chromatic number in expected polynomial time
- ON MIXING OF CERTAIN RANDOM WALKS, CUTOFF PHENOMENON AND SHARP
- ON THE CONCENTRATION OF MULTI-VARIATE POLYNOMIALS WITH SMALL EXPECTATION
- ON A REFINEMENT OF WARING'S PROBLEM Microsoft Research
- ON A THEOREM OF GANTER Department of Mathematics, Yale university
- COINS AND CONES DMITRY N. KOZLOV AND VAN H. VU
- A STRONGLY REGULAR N-Full GRAPH OF SMALL Dept of Math, Yale Univ, New Haven, CT 05620, U.S.A.
- EXTREMAL SYSTEMS WITH UPPER-BOUNDED ODD INTERSECTIONS
- NEW BOUNDS ON NEARLY PERFECT MATCHINGS IN HYPERGRAPHS: HIGHER CODEGREES DO HELP
- Turan's Theorem in sparse random graphs Tibor Szabo
- A sharp threshold for network reliability Michael Krivelevich
- Eigenvalues of Random Power Law Graphs January 13, 2003
- A generalization of Turan's theorem Benny Sudakov
- A GENERAL UPPER BOUND ON THE LIST CHROMATIC NUMBER OF LOCALLY SPARSE GRAPHS