• Publications
  • Influence
An approximation of partial sums of independent RV'-s, and the sample DF. I
SummaryLet Sn=X1+X2+⋯+Xnbe the sum of i.i.d.r.v.-s, EX1=0, EX12=1, and let Tn= Y1+Y2+⋯+Ynbe the sum of independent standard normal variables. Strassen proved in [14] that if X1 has a finite fourthExpand
  • 994
  • 68
  • PDF
Blow-up Lemma
TLDR
Regular pairs behave like complete bipartite graphs from the point of view of bounded degree subgraphs. Expand
  • 255
  • 62
  • PDF
The eigenvalues of random symmetric matrices
TLDR
We show that with probability 1-o(1)all eigenvalues belong to the above intervalI if μ=0, while in case μ>0 only the largest eigenvalue λ1 is outsideI. Expand
  • 604
  • 60
  • PDF
Szemeredi''s Regularity Lemma and its applications in graph theory
Szemer\''edi''s Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by random-looking graphs. Therefore the lemma helps inExpand
  • 533
  • 49
A Note on Ramsey Numbers
TLDR
We prove R(3, x) cx 2 ln x and, for each k ⩾ 3, R(k,x) c k x k − 2 asymptotically in x . Expand
  • 316
  • 48
O(n LOG n) SORTING NETWORK.
  • 423
  • 43
Storing a sparse table with O(1) worst case access time
TLDR
We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time. Expand
  • 772
  • 39
  • PDF
A generalization of a problem of Steinhaus
This is the fixed version of an article made available by an organization that acts as a publisher by formally and exclusively declaring the article "published". If it is an "early release" articleExpand
  • 282
  • 39
On the probability that a random ±1-matrix is singular
We report some progress on the old problem of estimating the probability, Pn, that a random n× n ± 1 matrix is singular: Theorem. There is a positive constant ε for which Pn < (1− ε)n. This is aExpand
  • 193
  • 35
  • PDF
Proof of the Seymour conjecture for large graphs
Paul Seymour conjectured that any graphG of ordern and minimum degree of at leastk/k+1n contains thekth power of a Hamiltonian cycle. Here, we prove this conjecture for sufficiently largen.
  • 117
  • 28
  • PDF