2 citations · 2 across the 2 of their papers we have counts for
5 papers
Pseudo-random graphs
Michael Krivelevich, Benny Sudakov
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject…
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
Elchanan Mossel, Ryan O'Donnell, Oded Regev +2
In this paper we study non-interactive correlation distillation (NICD), a generalization of the study of noise sensitivity of boolean functions. We extend the model to NICD on tree…
List colouring of graphs with at most vertices
Bruce Reed, Benny Sudakov
Ohba has conjectured \cite{ohb} that if the graph has or fewer vertices then the list chromatic number and chromatic number of are equal. In this paper we prove t…
On a hypergraph Turan problem of Frankl
Peter Keevash, Benny Sudakov
Let be the -uniform hypergraph obtained by letting be pairwise disjoint sets of size and taking as edges all sets with . T…
THe largest eigenvalue of sparse random graphs
Michael Krivelevich, Benny Sudakov
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n,p) satisfies almost surely: λ_1(G)=(1+o(1))max{\sqrtΔ,np}, where Δis a maxima…