Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Finding a large hidden clique in a random graph

- N. Alon, M. Krivelevich, B. Sudakov
- Mathematics, Computer ScienceSODA '98
- 1998

TLDR

Pseudo-random Graphs

- M. Krivelevich, B. Sudakov
- Computer Science
- 31 March 2005

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 for their own sake,… Expand

Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions

- N. Alon, M. Krivelevich, B. Sudakov
- MathematicsCombinatorics, Probability and Computing
- 1 November 2003

TLDR

Coloring Graphs with Sparse Neighborhoods

- N. Alon, M. Krivelevich, B. Sudakov
- MathematicsJ. Comb. Theory, Ser. B
- 1 September 1999

It is shown that the chromatic number of any graph with maximum degree d in which the number of edges in the induced subgraph on the set of all neighbors of any vertex does not exceed d2/f is at most… Expand

The Largest Eigenvalue of Sparse Random Graphs

- M. Krivelevich, B. Sudakov
- MathematicsCombinatorics, Probability and Computing
- 10 June 2001

We prove that, for all values of the edge probability $p(n)$, the largest eigenvalue of the random graph $G(n, p)$ satisfies almost surely $\lambda_1(G)=(1+o(1))\max\{\sqrt{\Delta}, np\}$, where Δ is… Expand

The Number of Edge Colorings with no Monochromatic Cliques

- N. Alon, J. Balogh, Peter Keevash, B. Sudakov
- Mathematics
- 1 October 2004

Let F(n,r,k) denote the maximum possible number of distinct edge‐colorings of a simple graph on n vertices with r colors which contain no monochromatic copy of Kk. It is shown that for every fixed k… Expand

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels

- N. Alon, P. Frankl, Hao-wei Huang, V. Rödl, A. Rucinski, B. Sudakov
- MathematicsJ. Comb. Theory, Ser. A
- 6 July 2011

Rainbow Turán Problems

- Peter Keevash, D. Mubayi, B. Sudakov, Jacques Verstraëte
- MathematicsCombinatorics, Probability and Computing
- 4 September 2006

TLDR

Dirac's theorem for random graphs

- Choongbum Lee, B. Sudakov
- Mathematics, Computer ScienceRandom Struct. Algorithms
- 11 August 2011

TLDR

Acyclic edge colorings of graphs

- N. Alon, B. Sudakov, A. Zaks
- Mathematics
- 1 July 2001

A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a′(G), is the least number of colors in an… Expand

...

1

2

3

4

5

...