Lista de obras - Benny Sudakov - Dominio Público Uruguay

3‐Color bipartite Ramsey number of cycles and paths

scholarly article

A Note on Odd Cycle-Complete Graph Ramsey Numbers

artículo científico publicado en 2001

A conjecture of Erdős on graph Ramsey numbers

artículo científico publicado en 2011

A counterexample to Stein’s Equi-$n$-square Conjecture

artículo científico publicado en 2019

A counterexample to the Alon-Saks-Seymour conjecture and related problems

artículo científico publicado en 2012

Acyclic edge colorings of graphs

Additive approximation for edge-deletion problems ⬇️

artículo científico de 'Annals of Mathematics' publicado en 2009

An Approximate Version of Sidorenko’s Conjecture

artículo científico publicado en 2010

An algebraic perspective on integer sparse recovery

scholarly article

An extremal problem for integer sparse recovery ⬇️

artículo científico publicado en 2020

An improved bound for the stepping-up lemma

artículo científico publicado en 2013

Anticoncentration for subgraph statistics

artículo científico publicado en 2018

Asymptotics in percolation on high‐girth expanders ⬇️

scholarly article

Bandwidth theorem for random graphs ⬇️

artículo científico de 'Journal of Combinatorial Theory, Series B' publicado en 2012

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

artículo científico publicado en 2013

Counting Hamilton cycles in sparse random directed graphs ⬇️

artículo científico de 'Random Structures & Algorithms' publicado en 2018

Cycle lengths in sparse graphs

Cycles of many lengths in Hamiltonian graphs

artículo científico publicado en 2022

Dense Induced Bipartite Subgraphs in Triangle-Free Graphs ⬇️

scholarly article

Density theorems for bipartite graphs and related Ramsey-type results ⬇️

scholarly article

Dirac's theorem for random graphs ⬇️

artículo científico de 'Random Structures & Algorithms' publicado en 2012

Directed Ramsey number for trees

scholarly article

Embedding nearly-spanning bounded degree trees ⬇️

artículo científico de 'Combinatorica' publicado en 2007

Erdős–Szekeres theorem for multidimensional arrays

artículo científico publicado en 2022

Finding a large hidden clique in a random graph

scholarly article by Noga Alon et al published October 1998 in Random Structures and Algorithms

Halfway to Rota’s Basis Conjecture

artículo científico publicado en 2020

Increasing the chromatic number of a random graph ⬇️

artículo científico de 'Journal of Combinatorics' publicado en 2010

Infinite Sperner's theorem

artículo científico publicado en 2022

Judicious partitions of directed graphs

artículo científico publicado en 2014

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

artículo científico de 'Journal of Combinatorial Theory, Series A' publicado en 2012

Linearly many rainbow trees in properly edge-coloured complete graphs

artículo científico publicado en 2018

Local resilience of graphs ⬇️

artículo científico de 'Random Structures and Algorithms' publicado en 2008

Long Monotone Trails in Random Edge-Labellings of Random Graphs ⬇️

scholarly article

Minimum saturated families of sets

artículo científico publicado en 2018

Monochromatic cycle covers in random graphs

artículo científico publicado en 2018

Monochromatic paths in random tournaments

artículo científico publicado en 2018

Monochromatic trees in random tournaments ⬇️

scholarly article

New bounds for Ryser’s conjecture and related problems

artículo científico publicado en 2022

Nonnegative k-sums, fractional covers, and probability of small deviations ⬇️

artículo científico de 'Journal of Combinatorial Theory, Series B' publicado en 2012

Number of 1-Factorizations of Regular High-Degree Graphs

artículo científico publicado en 2020

On a conjecture of Erdős and Simonovits: Even cycles

artículo científico publicado en 2013

On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs ⬇️

artículo científico de 'SIAM Journal on Discrete Mathematics' publicado en 2011

Proof of a conjecture on induced subgraphs of Ramsey graphs

artículo científico publicado en 2018

Properly colored and rainbow copies of graphs with few cherries ⬇️

article by Benny Sudakov & Jan Volec published January 2017 in Journal of Combinatorial Theory, Series B

Pseudo-random Graphs ⬇️

capítulo de 'More Sets, Graphs and Numbers' publicado en 2006

Rainbow Turán Problems ⬇️

artículo científico de 'Combinatorics, Probability and Computing' publicado en 2007

Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes

artículo científico publicado en 2018

Ramsey games with giants

Ramsey-type results for semi-algebraic relations

scientific article published in 2014

Recent developments in graph Ramsey theory ⬇️

capítulo de 'Surveys in Combinatorics 2015' publicado en 2015

Resilient Pancyclicity of Random and Pseudorandom Graphs ⬇️

artículo científico de 'SIAM Journal on Discrete Mathematics' publicado en 2010

Robust Hamiltonicity of Dirac graphs ⬇️

artículo científico de 'Transactions of the American Mathematical Society' publicado en 2014

Short Proofs of Rainbow Matchings Results

artículo científico publicado en 2022

Short proofs of some extremal results III

scientific article published in 2020

Sparse pseudo-random graphs are Hamiltonian ⬇️

artículo científico de 'Journal of Graph Theory' publicado en 2003

Submodular Minimization Under Congruency Constraints

artículo científico publicado en 2019

THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES ⬇️

artículo científico de 'Journal of the London Mathematical Society' publicado en 2004

The Strong Chromatic Index of Random Graphs

The game chromatic number of random graphs

scholarly article by Tom Bohman et al published 2008 in Random Structures and Algorithms

The minimum number of disjoint pairs in set systems and related problems ⬇️

artículo científico de 'arXiv:1305.6715 [math]' publicado en 2013

Threshold Ramsey multiplicity for paths and even cycles

artículo científico publicado en 2023

Tower-type bounds for unavoidable patterns in words

scholarly article

Two remarks on the Burr–Erdős conjecture

artículo científico publicado en 2009

Lista de obras de Benny Sudakov

3‐Color bipartite Ramsey number of cycles and paths

A Note on Odd Cycle-Complete Graph Ramsey Numbers

A conjecture of Erdős on graph Ramsey numbers

A counterexample to Stein’s Equi-$n$-square Conjecture

A counterexample to the Alon-Saks-Seymour conjecture and related problems

Acyclic edge colorings of graphs

Additive approximation for edge-deletion problems ⬇️

An Approximate Version of Sidorenko’s Conjecture

An algebraic perspective on integer sparse recovery

An extremal problem for integer sparse recovery ⬇️

An improved bound for the stepping-up lemma

Anticoncentration for subgraph statistics

Asymptotics in percolation on high‐girth expanders ⬇️

Bandwidth theorem for random graphs ⬇️

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

Counting Hamilton cycles in sparse random directed graphs ⬇️

Cycle lengths in sparse graphs

Cycles of many lengths in Hamiltonian graphs

Dense Induced Bipartite Subgraphs in Triangle-Free Graphs ⬇️

Density theorems for bipartite graphs and related Ramsey-type results ⬇️

Dirac's theorem for random graphs ⬇️

Directed Ramsey number for trees

Embedding nearly-spanning bounded degree trees ⬇️

Erdős–Szekeres theorem for multidimensional arrays

Finding a large hidden clique in a random graph

Halfway to Rota’s Basis Conjecture

Increasing the chromatic number of a random graph ⬇️

Infinite Sperner's theorem

Judicious partitions of directed graphs

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

Linearly many rainbow trees in properly edge-coloured complete graphs

Local resilience of graphs ⬇️

Long Monotone Trails in Random Edge-Labellings of Random Graphs ⬇️

Minimum saturated families of sets

Monochromatic cycle covers in random graphs

Monochromatic paths in random tournaments

Monochromatic trees in random tournaments ⬇️

New bounds for Ryser’s conjecture and related problems

Nonnegative k-sums, fractional covers, and probability of small deviations ⬇️

Number of 1-Factorizations of Regular High-Degree Graphs

On a conjecture of Erdős and Simonovits: Even cycles

On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs ⬇️

Proof of a conjecture on induced subgraphs of Ramsey graphs

Properly colored and rainbow copies of graphs with few cherries ⬇️

Pseudo-random Graphs ⬇️

Rainbow Turán Problems ⬇️

Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes

Ramsey games with giants

Ramsey-type results for semi-algebraic relations

Recent developments in graph Ramsey theory ⬇️

Resilient Pancyclicity of Random and Pseudorandom Graphs ⬇️

Robust Hamiltonicity of Dirac graphs ⬇️

Short Proofs of Rainbow Matchings Results

Short proofs of some extremal results III

Sparse pseudo-random graphs are Hamiltonian ⬇️

Submodular Minimization Under Congruency Constraints

THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES ⬇️

The Strong Chromatic Index of Random Graphs

The game chromatic number of random graphs

The minimum number of disjoint pairs in set systems and related problems ⬇️

Threshold Ramsey multiplicity for paths and even cycles

Tower-type bounds for unavoidable patterns in words

Two remarks on the Burr–Erdős conjecture

Two-Sided, Unbiased Version of Hall’s Marriage Theorem