105 citations · 219 across the 3 of their papers we have counts for
5 papers
Dense graphs are antimagic
N. Alon, G. Kaplan, A. Lev +2
An {\em antimagic labeling} of a graph with edges and vertices is a bijection from the set of edges to the integers such that all vertex sums are pairwise dis…
Discrete mathematics: methods and challenges
Noga Alon
Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent ye…
Percolation on finite graphs and isoperimetric inequalities
Noga Alon, Itai Benjamini, Alan Stacey
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly…
On the concentration of eigenvalues of random symmetric matrices
Michael Krivelevich, Van H. Vu
We prove that few largest (and most important) eigenvalues of random symmetric matrices of various kinds are very strongly concentrated. This strong concentration enables us to com…
Packing Ferrers Shapes
Noga Alon, Miklós Bóna, Joel Spencer
Answering a question of Wilf, we show that if is sufficiently large, then one cannot cover an rectangle using each of the distinct Ferrers shapes of size…