Benny Sudakov

According to our database1, Benny Sudakov authored at least 217 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Ramsey Goodness of Cycles.
SIAM J. Discret. Math., 2020

Books versus Triangles at the Extremal Density.
SIAM J. Discret. Math., 2020

The Kőnig graph process.
Random Struct. Algorithms, 2020

Short proofs of some extremal results III.
Random Struct. Algorithms, 2020

Completion and deficiency problems.
J. Comb. Theory, Ser. B, 2020

2-factors with <i>k</i> cycles in Hamiltonian graphs.
J. Comb. Theory, Ser. B, 2020

The oriented size Ramsey number of directed paths.
Eur. J. Comb., 2020

Long directed rainbow cycles and rainbow spanning trees.
Eur. J. Comb., 2020

Orthonormal Representations of H-Free Graphs.
Discret. Comput. Geom., 2020

Monochromatic trees in random tournaments.
Comb. Probab. Comput., 2020

Long Monotone Trails in Random Edge-Labellings of Random Graphs.
Comb. Probab. Comput., 2020

Bounded Degree Spanners of the Hypercube.
Electron. J. Comb., 2020

Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.
Comb., 2020

Number of 1-Factorizations of Regular High-Degree Graphs.
Comb., 2020

Lower Bounds for Max-Cut via Semidefinite Programming.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
The Zero Forcing Number of Graphs.
SIAM J. Discret. Math., 2019

Anticoncentration for subgraph statistics.
J. Lond. Math. Soc., 2019

3-Color bipartite Ramsey number of cycles and paths.
J. Graph Theory, 2019

Colouring set families without monochromatic <i>k</i>-chains.
J. Comb. Theory, Ser. A, 2019

Equiangular Subspaces in Euclidean Spaces.
Discret. Comput. Geom., 2019

An extremal problem for integer sparse recovery.
CoRR, 2019

Multicolour Bipartite Ramsey Number of Paths.
Electron. J. Comb., 2019

Submodular Minimization Under Congruency Constraints.
Comb., 2019

An algebraic perspective on integer sparse recovery.
Appl. Math. Comput., 2019

2018
Two Remarks on Eventown and Oddtown Problems.
SIAM J. Discret. Math., 2018

Intercalates and discrepancy in random Latin squares.
Random Struct. Algorithms, 2018

The random k-matching-free process.
Random Struct. Algorithms, 2018

Monochromatic cycle covers in random graphs.
Random Struct. Algorithms, 2018

Counting Hamilton cycles in sparse random directed graphs.
Random Struct. Algorithms, 2018

Linearly many rainbow trees in properly edge-coloured complete graphs.
J. Comb. Theory, Ser. B, 2018

Supersaturation in posets and applications involving the container method.
J. Comb. Theory, Ser. A, 2018

Non-trivially intersecting multi-part families.
J. Comb. Theory, Ser. A, 2018

Anagram-Free Colourings of Graphs.
Comb. Probab. Comput., 2018

Ramsey Goodness of Bounded Degree Trees.
Comb. Probab. Comput., 2018

2017
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.
SIAM J. Discret. Math., 2017

Saturation in random graphs.
Random Struct. Algorithms, 2017

Finding paths in sparse random graphs requires many queries.
Random Struct. Algorithms, 2017

Ramsey goodness of paths.
J. Comb. Theory, Ser. B, 2017

Domination in 3-tournaments.
J. Comb. Theory, Ser. A, 2017

Counting and packing Hamilton cycles in dense graphs and oriented graphs.
J. Comb. Theory, Ser. B, 2017

Ordered Ramsey numbers.
J. Comb. Theory, Ser. B, 2017

Edge-disjoint rainbow trees in properly coloured complete graphs.
Electron. Notes Discret. Math., 2017

Anagram-free colorings of graphs.
Electron. Notes Discret. Math., 2017

Monochromatic paths in random tournaments.
Electron. Notes Discret. Math., 2017

Directed Ramsey number for trees.
Electron. Notes Discret. Math., 2017

Equiangular lines and subspaces in Euclidean spaces.
Electron. Notes Discret. Math., 2017

Bounded colorings of multipartite graphs and hypergraphs.
Eur. J. Comb., 2017

The Threshold Probability for Long Cycles.
Comb. Probab. Comput., 2017

The Extremal Function for Cycles of Length l mod k.
Electron. J. Comb., 2017

Compatible Hamilton cycles in Dirac graphs.
Comb., 2017

Cycles in triangle-free graphs of large chromatic number.
Comb., 2017

2016
On the Maximum Quartet Distance between Phylogenetic Trees.
SIAM J. Discret. Math., 2016

Judicious partitions of directed graphs.
Random Struct. Algorithms, 2016

Compatible Hamilton cycles in random graphs.
Random Struct. Algorithms, 2016

Random directed graphs are robustly Hamiltonian.
Random Struct. Algorithms, 2016

Finding Hamilton cycles in random graphs with few queries.
Random Struct. Algorithms, 2016

Short proofs of some extremal results II.
J. Comb. Theory, Ser. B, 2016

Testing Equality in Communication Graphs.
Electron. Colloquium Comput. Complex., 2016

On the densities of cliques and independent sets in graphs.
Comb., 2016

The minimum number of disjoint pairs in set systems and related problems.
Comb., 2016

Ramsey numbers of cubes versus cliques.
Comb., 2016

2015
Discrepancy of random graphs and hypergraphs.
Random Struct. Algorithms, 2015

Long paths and cycles in random subgraphs of graphs with large minimum degree.
Random Struct. Algorithms, 2015

On the number of monotone sequences.
J. Comb. Theory, Ser. B, 2015

Comparable pairs in families of sets.
J. Comb. Theory, Ser. B, 2015

Properly colored and rainbow copies of graphs with few cherries.
Electron. Notes Discret. Math., 2015

Cycles and matchings in randomly perturbed digraphs and hypergraphs.
Electron. Notes Discret. Math., 2015

A random triadic process.
Electron. Notes Discret. Math., 2015

Some Remarks on Rainbow Connectivity.
Electron. Notes Discret. Math., 2015

Almost-Fisher families.
Electron. Notes Discret. Math., 2015

K<sub>s, t</sub>-saturated bipartite graphs.
Eur. J. Comb., 2015

Decomposing Random Graphs into Few Cycles and Edges.
Comb. Probab. Comput., 2015

Maximizing the Number of Independent Sets of a Fixed Size.
Comb. Probab. Comput., 2015

Sperner's Theorem and a Problem of Erdős, Katona and Kleitman.
Comb. Probab. Comput., 2015

Most Probably Intersecting Hypergraphs.
Electron. J. Comb., 2015

Small complete minors above the extremal edge density.
Comb., 2015

Recent developments in graph Ramsey theory.
Proceedings of the Surveys in Combinatorics 2015, 2015

2014
Musical Chairs.
SIAM J. Discret. Math., 2014

Cycle packing.
Random Struct. Algorithms, 2014

On the 3-Local Profiles of Graphs.
J. Graph Theory, 2014

Turán numbers of bipartite graphs plus an odd cycle.
J. Comb. Theory, Ser. B, 2014

Short Proofs of Some Extremal Results.
Comb. Probab. Comput., 2014

The Minimum Number of Nonnegative Edges in Hypergraphs.
Electron. J. Comb., 2014

How Many Colors Guarantee a Rainbow Matching?
Electron. J. Comb., 2014

2013
Self-Similarity of Graphs.
SIAM J. Discret. Math., 2013

The phase transition in random graphs: A simple proof.
Random Struct. Algorithms, 2013

Longest cycles in sparse random digraphs.
Random Struct. Algorithms, 2013

Bisections of graphs.
J. Comb. Theory, Ser. B, 2013

A problem of Erdős on the minimum number of k-cliques.
J. Comb. Theory, Ser. B, 2013

All-pairs shortest paths in <i>O</i>(<i>n</i><sup>2</sup>) time with high probability.
J. ACM, 2013

Rainbow Turán problem for even cycles.
Eur. J. Comb., 2013

An improved bound for the stepping-up lemma.
Discret. Appl. Math., 2013

Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs.
Comb. Probab. Comput., 2013

On a conjecture of Erdős and Simonovits: Even cycles.
Comb., 2013

Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz.
Comb., 2013

Genome reassembly with high-throughput sequencing data.
BMC Genom., 2013

Ramsey-type results for semi-algebraic relations.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
Dirac's theorem for random graphs.
Random Struct. Algorithms, 2012

Long cycles in subgraphs of (pseudo)random directed graphs.
J. Graph Theory, 2012

Bandwidth theorem for random graphs.
J. Comb. Theory, Ser. B, 2012

Erdős-Hajnal-type theorems in hypergraphs.
J. Comb. Theory, Ser. B, 2012

The size Ramsey number of a directed path.
J. Comb. Theory, Ser. B, 2012

Nonnegative k-sums, fractional covers, and probability of small deviations.
J. Comb. Theory, Ser. B, 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.
J. Comb. Theory, Ser. A, 2012

Hamiltonicity, independence number, and pancyclicity.
Eur. J. Comb., 2012

Biased orientation games.
Discret. Math., 2012

Getting a Directed Hamilton Cycle Two Times Faster.
Comb. Probab. Comput., 2012

The Size of a Hypergraph and its Matching Number.
Comb. Probab. Comput., 2012

A counterexample to the Alon-Saks-Seymour conjecture and related problems.
Comb., 2012

On two problems in graph Ramsey theory.
Comb., 2012

Nearly complete graphs decomposable into large induced matchings and their applications.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011
A Bound for the Cops and Robbers Problem.
SIAM J. Discret. Math., 2011

On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs.
SIAM J. Discret. Math., 2011

Regular induced subgraphs of a random Graph.
Random Struct. Algorithms, 2011

Dependent random choice.
Random Struct. Algorithms, 2011

Ramsey games with giants.
Random Struct. Algorithms, 2011

Generating all subsets of a finite set with disjoint unions.
J. Comb. Theory, Ser. A, 2011

Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs.
Comb. Probab. Comput., 2011

Two extensions of Ramsey's theorem
CoRR, 2011

Oblivious Collaboration.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010
Resilient Pancyclicity of Random and Pseudorandom Graphs.
SIAM J. Discret. Math., 2010

Hamiltonicity thresholds in Achlioptas processes.
Random Struct. Algorithms, 2010

Pancyclicity of Hamiltonian and highly connected graphs.
J. Comb. Theory, Ser. B, 2010

Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors.
J. ACM, 2010

Decompositions into Subgraphs of Small Diameter.
Comb. Probab. Comput., 2010

Directed Graphs Without Short Cycles.
Comb. Probab. Comput., 2010

Maximum union-free subfamilies
CoRR, 2010

A randomized embedding algorithm for trees.
Comb., 2010

All-Pairs Shortest Paths in O(n<sup>2</sup>) Time with High Probability.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009
Avoiding small subgraphs in Achlioptas processes.
Random Struct. Algorithms, 2009

Ramsey numbers of sparse hypergraphs.
Random Struct. Algorithms, 2009

Triangle packings and 1-factors in oriented graphs.
J. Comb. Theory, Ser. B, 2009

Large induced trees in K<sub>r</sub>-free graphs.
J. Comb. Theory, Ser. B, 2009

Two remarks on the Burr-Erdos conjecture.
Eur. J. Comb., 2009

On the Random Satisfiable Process.
Comb. Probab. Comput., 2009

Paths and Stability Number in Digraphs.
Electron. J. Comb., 2009

Density theorems for bipartite graphs and related Ramsey-type results.
Comb., 2009

2008
Ramsey-Type Problem for an Almost Monochromatic K<sub>4</sub>.
SIAM J. Discret. Math., 2008

Large Nearly Regular Induced Subgraphs.
SIAM J. Discret. Math., 2008

Local resilience of graphs.
Random Struct. Algorithms, 2008

How many random edges make a dense hypergraph non-2-colorable?
Random Struct. Algorithms, 2008

The game chromatic number of random graphs.
Random Struct. Algorithms, 2008

On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs.
J. Comb. Theory, Ser. B, 2008

Unavoidable patterns.
J. Comb. Theory, Ser. A, 2008

On the Strong Chromatic Number of Random Graphs.
Comb. Probab. Comput., 2008

Cycle lengths in sparse graphs.
Comb., 2008

2007
Ramsey Numbers and the Size of Graphs.
SIAM J. Discret. Math., 2007

On graphs with subgraphs having large independence numbers.
J. Graph Theory, 2007

Independent transversals in locally sparse graphs.
J. Comb. Theory, Ser. B, 2007

Induced subgraphs of Ramsey graphs with many distinct degrees.
J. Comb. Theory, Ser. B, 2007

Constrained Ramsey Numbers.
Electron. Notes Discret. Math., 2007

Induced Ramsey-type theorems.
Electron. Notes Discret. Math., 2007

Small subgraphs of random regular graphs.
Discret. Math., 2007

Rainbow Turán Problems.
Comb. Probab. Comput., 2007

Note making a <i>K</i> <sub>4</sub>-free graph bipartite.
Comb., 2007

Embedding nearly-spanning bounded degree trees.
Comb., 2007

2006
On smoothed analysis in dense graphs and formulas.
Random Struct. Algorithms, 2006

A Ramsey-type result for the hypercube.
J. Graph Theory, 2006

Sparse halves in triangle-free graphs.
J. Comb. Theory, Ser. B, 2006

On a restricted cross-intersection problem.
J. Comb. Theory, Ser. A, 2006

On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.
J. Comb. Theory, Ser. B, 2006

Preface.
Eur. J. Comb., 2006

Bounding the Number of Edges in Permutation Graphs.
Electron. J. Comb., 2006

H-Free Graphs of Large Minimum Degree.
Electron. J. Comb., 2006

Additive Approximation for Edge-Deletion Problems (Abstract).
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices.
SIAM J. Discret. Math., 2005

The Strong Chromatic Index of Random Graphs.
SIAM J. Discret. Math., 2005

Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems.
Random Struct. Algorithms, 2005

A generalization of Turán's theorem.
J. Graph Theory, 2005

Disjoint representability of sets and their complements.
J. Comb. Theory, Ser. B, 2005

A New Lower Bound For A Ramsey-Type Problem.
Comb., 2005

On A Hypergraph Turán Problem Of Frankl.
Comb., 2005

The Turán Number Of The Fano Plane.
Comb., 2005

Additive Approximation for Edge-Deletion Problems.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Learning a Hidden Matching.
SIAM J. Comput., 2004

Packing triangles in a graph and its complement.
J. Graph Theory, 2004

On the number of edges not covered by monochromatic copies of a fixed graph.
J. Comb. Theory, Ser. B, 2004

Extremal set systems with restricted k-wise intersections.
J. Comb. Theory, Ser. A, 2004

Multicoloured extremal problems.
J. Comb. Theory, Ser. A, 2004

List Colouring When The Chromatic Number Is Close To the Order Of The Graph.
Comb., 2004

Triangle Factors In Sparse Pseudo-Random Graphs.
Comb., 2004

On the Value of a Random Minimum Weight Steiner Tree.
Comb., 2004

Multicolour Turán problems.
Adv. Appl. Math., 2004

2003
Covering codes with improved density.
IEEE Trans. Inf. Theory, 2003

On the probability of independent sets in random graphs.
Random Struct. Algorithms, 2003

Sparse pseudo-random graphs are Hamiltonian.
J. Graph Theory, 2003

Induced subgraphs of prescribed size.
J. Graph Theory, 2003

A few remarks on Ramsey-Tura'n-type problems.
J. Comb. Theory, Ser. B, 2003

Maximum cuts and judicious partitions in graphs without short cycles.
J. Comb. Theory, Ser. B, 2003

Approximate coloring of uniform hypergraphs.
J. Algorithms, 2003

The Largest Eigenvalue Of Sparse Random Graphs.
Comb. Probab. Comput., 2003

On Ramsey Numbers of Sparse Graphs.
Comb. Probab. Comput., 2003

Local Density In Graphs With Forbidden Subgraphs.
Comb. Probab. Comput., 2003

Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions.
Comb. Probab. Comput., 2003

2002
On the asymmetry of random regular graphs and random graphs.
Random Struct. Algorithms, 2002

Asymptotically the List Colouring Constants Are 1.
J. Comb. Theory, Ser. B, 2002

On k-wise set-intersections and k-wise Hamming-distances.
J. Comb. Theory, Ser. A, 2002

A Sharp Threshold For Network Reliability.
Comb. Probab. Comput., 2002

A Note on Odd Cycle-Complete Graph Ramsey Numbers.
Electron. J. Comb., 2002

2001
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms.
SIAM J. Discret. Math., 2001

Random regular graphs of high degree.
Random Struct. Algorithms, 2001

Acyclic edge colorings of graphs.
J. Graph Theory, 2001

Nowhere-Zero Flows in Random Graphs.
J. Comb. Theory, Ser. B, 2001

Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs.
J. Algorithms, 2001

Asymptotically Optimal Tree-Packings in Regular Graphs.
Electron. J. Comb., 2001

2000
Bipartite Subgraphs And The Smallest Eigenvalue.
Comb. Probab. Comput., 2000

1999
Coloring Graphs with Sparse Neighborhoods.
J. Comb. Theory, Ser. B, 1999

On Two Segmentation Problems.
J. Algorithms, 1999

List Coloring of Random and Pseudo-Random Graphs.
Comb., 1999

1998
The chromatic numbers of random hypergraphs.
Random Struct. Algorithms, 1998

Finding a large hidden clique in a random graph.
Random Struct. Algorithms, 1998

Coloring Random Graphs.
Inf. Process. Lett., 1998

Note on alternating directed cycles.
Discret. Math., 1998

Approximate Coloring of Uniform Hypergraphs (Extended Abstract).
Proceedings of the Algorithms, 1998

1997
A Note on τ-Critical Linear Hypergraphs.
Graphs Comb., 1997

1995
Disjoint Systems.
Random Struct. Algorithms, 1995

1993
Disjoint Systems (Extended Abstract).
Proceedings of the Algebraic Coding, 1993


  Loading...