#### Filter Results:

- Full text PDF available (215)

#### Publication Year

1991

2019

- This year (19)
- Last 5 years (93)
- Last 10 years (166)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Noga Alon, Michael Krivelevich, Benny Sudakov
- SODA
- 1998

We consider the following probabilistic model of a graph on n labeled vertices. First choose a random graph G(n, 1/2) and then choose randomly a subset Q of vertices of size k and force it to be aâ€¦ (More)

- Noga Alon, Benny Sudakov, Ayal Zaks
- Journal of Graph Theory
- 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â€¦ (More)

- Noga Alon, Peter Frankl, Hao Huang, Vojtech RÃ¶dl, Andrzej Rucinski, Benny Sudakov
- J. Comb. Theory, Ser. A
- 2012

In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by ErdÅ‘s onâ€¦ (More)

- Noga Alon, Michael Krivelevich, Benny Sudakov
- Combinatorics, Probability & Computing
- 2003

For a graph H and an integer n, the TurÃ¡n number ex(n,H) is the maximum possible number of edges in a simple graph on n vertices that contains no copy of H . H is rdegenerate if every one of itsâ€¦ (More)

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â€¦ (More)

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,â€¦ (More)

- Michael Krivelevich, Benny Sudakov
- Journal of Graph Theory
- 2003

In this article we study Hamilton cycles in sparse pseudorandom graphs. We prove that if the second largest absolute value of an eigenvalue of a d-regular graph G on n vertices satisfies

- Jacob Fox, Benny Sudakov
- 2008

Ramsey theory refers to a large body of deep results in mathematics whose underlying philosophy is captured succinctly by the statement that â€œEvery large system contains a large well-organizedâ€¦ (More)

- Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
- Random Struct. Algorithms
- 2001

Random d-regular graphs have been well studied when d is fixed and the number of vertices goes to infinity. We obtain results on many of the properties of a random d-regular graph when d = d n growsâ€¦ (More)

- Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
- FOCS
- 2002