Benny Sudakov | Academic Influence

Benny Sudakov's AcademicInfluence.com Rankings

Benny Sudakov

Mathematics

#421

World Rank

#848

Historical Rank

Combinatorics

#18

World Rank

#22

Historical Rank

Graph Theory

#22

World Rank

#29

Historical Rank

Measure Theory

#1794

World Rank

#2198

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Benny Sudakov's Degrees

PhD Mathematics Tel Aviv University
Masters Mathematics Tel Aviv University
Bachelors Mathematics Tel Aviv University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Benny Sudakov Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Benny Sudakov is an Israeli mathematician, who works mainly on extremal and probabilistic combinatorics. He was born in Tbilissi, Georgia, and completed his undergraduate studies at Tbilisi State University in 1990. After emigrating to Israel, he received his PhD from Tel Aviv University in 1999, under the supervision of Noga Alon. From 1999 until 2002 he held a Veblen Research Instructorship, a joint position between Princeton University and the Institute for Advanced Study. Until 2007 he was an assistant professor at Princeton University. Until 2014, he was a professor at the University of California, Los Angeles. In July 2013 Sudakov joined ETH Zurich as a professor.

(See a Problem?)

Benny Sudakov's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Finding a large hidden clique in a random graph (1998) (415)
Pseudo-random Graphs (2005) (369)
The Largest Eigenvalue of Sparse Random Graphs (2001) (185)
Acyclic edge colorings of graphs (2001) (178)
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors (2005) (169)
Recent developments in graph Ramsey theory (2015) (152)
Local resilience of graphs (2007) (133)
Coloring Graphs with Sparse Neighborhoods (1999) (132)
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions (2003) (119)
The phase transition in random graphs: A simple proof (2012) (119)
Random regular graphs of high degree (2001) (117)
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels (2011) (115)
Dependent random choice (2009) (115)
An Approximate Version of Sidorenko’s Conjecture (2010) (109)
The Size of a Hypergraph and its Matching Number (2011) (106)
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (2004) (104)
Density theorems for bipartite graphs and related Ramsey-type results (2007) (101)
Hypergraph Ramsey numbers (2008) (101)
The Turán Number Of The Fano Plane (2005) (96)
Sparse pseudo‐random graphs are Hamiltonian (2003) (90)
Graph Products, Fourier Analysis and Spectral Techniques (2004) (89)
Learning a hidden matching (2002) (86)
Maximum cuts and judicious partitions in graphs without short cycles (2003) (84)
On the asymmetry of random regular graphs and random graphs (2002) (82)
Bipartite Subgraphs and the Smallest Eigenvalue (2000) (80)
The Number of Edge Colorings with no Monochromatic Cliques (2004) (79)
Dirac's theorem for random graphs (2011) (70)
Rainbow Turán Problems (2006) (68)
The size Ramsey number of a directed path (2010) (66)
Induced Ramsey-type theorems (2007) (64)
A Bound for the Cops and Robbers Problem (2011) (64)
Erdős–Szekeres‐type theorems for monotone paths and convex bodies (2011) (63)
On A Hypergraph Turán Problem Of Frankl (2002) (61)
Nearly complete graphs decomposable into large induced matchings and their applications (2011) (61)
List Coloring of Random and Pseudo-Random Graphs (1999) (57)
Additive approximation for edge-deletion problems (2005) (57)
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs (2011) (57)
On smoothed analysis in dense graphs and formulas (2006) (55)
On a question of Erdős and Moser (2005) (52)
Nonnegative k-sums, fractional covers, and probability of small deviations (2011) (52)
Resilient Pancyclicity of Random and Pseudorandom Graphs (2009) (51)
The chromatic numbers of random hypergraphs (1998) (50)
Embedding nearly-spanning bounded degree trees (2007) (50)
Equiangular lines and spherical codes in Euclidean space (2016) (49)
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (2015) (49)
Cycle lengths in sparse graphs (2007) (48)
Hamiltonicity thresholds in Achlioptas processes (2008) (48)
On two problems in graph Ramsey theory (2010) (47)
Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs (2009) (47)
Approximating coloring and maximum independent sets in 3-uniform hypergraphs (2001) (46)
Maximizing the Number of Independent Sets of a Fixed Size (2013) (46)
Bisections of graphs (2011) (45)
Bandwidth theorem for random graphs (2010) (43)
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs (2015) (43)
Ramsey numbers of sparse hypergraphs (2007) (43)
Unavoidable patterns (2008) (41)
A counterexample to the Alon-Saks-Seymour conjecture and related problems (2010) (41)
List Colouring When The Chromatic Number Is Close To the Order Of The Graph (2004) (40)
Ordered Ramsey numbers (2014) (40)
A few remarks on Ramsey-Tura'n-type problems (2003) (39)
On k-wise set-intersections and k-wise Hamming-distances (2002) (38)
An improved bound for the stepping-up lemma (2009) (37)
Small subgraphs of random regular graphs (2007) (37)
Asymptotically the List Colouring Constants Are 1 (2002) (36)
Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems (2005) (36)
Rainbow Turán problem for even cycles (2012) (35)
Two remarks on the Burr-Erdos conjecture (2008) (35)
Ramsey-type results for semi-algebraic relations (2013) (35)
On the Value of a Random Minimum Weight Steiner Tree (2004) (35)
The Erdős–Gyárfás problem on generalized Ramsey numbers (2014) (35)
Maximizing the number of q‐colorings (2008) (34)
A Note on Odd Cycle-Complete Graph Ramsey Numbers (2001) (34)
Avoiding small subgraphs in Achlioptas processes (2007) (34)
Approximate coloring of uniform hypergraphs (1998) (34)
A generalization of Turán's theorem (2005) (33)
Robust Hamiltonicity of Dirac graphs (2012) (33)
A problem of Erdős on the minimum number of k-cliques (2012) (33)
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (2016) (32)
Large K r -free subgraphs in K s -free graphs and some other Ramsey-type problems (2005) (32)
Turán numbers of bipartite graphs plus an odd cycle (2012) (31)
Triangle packings and 1-factors in oriented graphs (2008) (30)
Triangle Factors In Sparse Pseudo-Random Graphs (2004) (29)
Robustness of graph properties (2016) (29)
Extremal set systems with restricted k-wise intersections (2004) (29)
ON A HYPERGRAPH TUR ´ AN PROBLEM OF FRANKL (2005) (29)
A proof of Ringel’s conjecture (2020) (27)
A Ramsey‐type result for the hypercube (2006) (27)
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices (2005) (27)
Long paths and cycles in random subgraphs of graphs with large minimum degree (2012) (27)
The minimum number of disjoint pairs in set systems and related problems (2013) (26)
Ramsey-Type Problem for an Almost Monochromatic K4 (2007) (26)
A New Lower Bound For A Ramsey-Type Problem (2005) (26)
Sperner's Theorem and a Problem of Erdős, Katona and Kleitman (2014) (26)
Embedding rainbow trees with applications to graph labelling and decomposition (2018) (26)
On Two Segmentation Problems (1999) (26)
Minors in Expanding Graphs (2007) (25)
Spectra of lifted Ramanujan graphs (2009) (25)
The game chromatic number of random graphs (2007) (25)
Linearly many rainbow trees in properly edge-coloured complete graphs (2017) (24)
All-Pairs Shortest Paths in O(n²) Time with High Probability (2010) (24)
Long cycles in subgraphs of (pseudo)random directed graphs (2010) (24)
Saturation in random graphs (2015) (23)
Short Proofs of Some Extremal Results (2012) (23)
Packing triangles in a graph and its complement (2004) (23)
The Zero Forcing Number of Graphs (2017) (23)
Induced subgraphs of prescribed size (2003) (22)
Ramsey games with giants (2009) (22)
Sperner's Theorem and a Problem of Erdos-Katona-Kleitman (2013) (22)
Longest cycles in sparse random digraphs (2011) (22)
A conjecture of Erdős on graph Ramsey numbers (2010) (21)
MaxCut in ${\bm H)$-Free Graphs (2005) (21)
Short proofs of some extremal results II (2015) (21)
Small complete minors above the extremal edge density (2012) (21)
On the probability of independent sets in random graphs (2003) (21)
New bounds for Ryser’s conjecture and related problems (2020) (20)
3‐Color bipartite Ramsey number of cycles and paths (2018) (20)
Anticoncentration for subgraph statistics (2018) (20)
Induced subgraphs of Ramsey graphs with many distinct degrees (2007) (20)
H-Free Graphs of Large Minimum Degree (2006) (20)
A new bound for the cops and robbers problem (2010) (20)
Multicolour Turán problems (2004) (19)
Constructing worst case instances for semidefinite programming based approximation algorithms (2001) (19)
Covering codes with improved density (2003) (19)
Halfway to Rota’s Basis Conjecture (2018) (18)
Independent transversals in locally sparse graphs (2007) (18)
On the 3‐Local Profiles of Graphs (2012) (18)
Submodular Minimization Under Congruency Constraints (2017) (17)
Finding Hamilton cycles in random graphs with few queries (2015) (17)
A randomized embedding algorithm for trees (2010) (17)
An algebraic perspective on integer sparse recovery (2018) (17)
Pancyclicity of Hamiltonian and highly connected graphs (2009) (17)
Counting and packing Hamilton cycles in dense graphs and oriented graphs (2012) (17)
Random directed graphs are robustly Hamiltonian (2014) (17)
Cycle packing (2013) (17)
On the grid Ramsey problem and related questions (2014) (16)
Proof of a conjecture on induced subgraphs of Ramsey graphs (2017) (16)
Self-Similarity of Graphs (2012) (16)
On Ramsey Numbers of Sparse Graphs (2003) (16)
On a conjecture of Erdős and Simonovits: Even cycles (2011) (16)
Note on alternating directed cycles (1998) (15)
List Colouring of Graphs with at Most (2 — o(l)) x Vertices (2002) (15)
How many random edges make a dense hypergraph non‐2‐colorable? (2007) (15)
Large induced trees in Kr-free graphs (2008) (15)
The Minimum Number of Nonnegative Edges in Hypergraphs (2013) (15)
Cycles in triangle-free graphs of large chromatic number (2014) (15)
Disjoint representability of sets and their complements (2005) (14)
Cores of random graphs are born Hamiltonian (2013) (14)
The Extremal Function for Cycles of Length l mod k (2016) (14)
Recent Developments in Extremal Combinatorics: Ramsey and Turan Type Problems (2011) (14)
Judicious partitions of directed graphs (2013) (14)
Multicolour Bipartite Ramsey Number of Paths (2019) (14)
A counterexample to Stein’s Equi-$n$-square Conjecture (2017) (14)
Some Remarks on Rainbow Connectivity (2015) (13)
How Many Colors Guarantee a Rainbow Matching? (2012) (13)
Properly colored and rainbow copies of graphs with few cherries (2015) (13)
Hypergraph Turán Problem : Some Open Questions (2011) (13)
Ramsey graphs induce subgraphs of quadratically many sizes (2017) (13)
The Extremal Number of Tight Cycles (2020) (13)
On graphs decomposable into induced matchings of linear sizes (2015) (13)
Asymptotics in percolation on high‐girth expanders (2018) (12)
Ks, t-saturated bipartite graphs (2014) (12)
Sparse pseudo-random graphs are Hamiltonian (2003) (12)
The random k‐matching‐free process (2017) (12)
Nearly-linear monotone paths in edge-ordered graphs (2018) (12)
The Strong Chromatic Index of Random Graphs (2005) (12)
Sparse halves in triangle-free graphs (2006) (12)
The regularity method for graphs with few 4‐cycles (2020) (12)
A Sharp Threshold for Network Reliability (2002) (12)
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs (2006) (12)
On the densities of cliques and independent sets in graphs (2012) (12)
Increasing the chromatic number of a random graph (2010) (11)
Tournament Quasirandomness from Local Counting (2019) (11)
Large Nearly Regular Induced Subgraphs (2007) (11)
The number of additive triples in subsets of abelian groups (2015) (11)
Finding paths in sparse random graphs requires many queries (2015) (11)
Note making a K4-free graph bipartite (2007) (11)
Intercalates and discrepancy in random Latin squares (2016) (11)
Local Density in Graphs with Forbidden Subgraphs (2003) (11)
On the Random Satisfiable Process (2008) (11)
Large almost monochromatic subsets in hypergraphs (2009) (11)
A Random Triadic Process (2015) (11)
Subgraphs with a large cochromatic number (1997) (11)
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz (2011) (11)
Erdos-Hajnal-type theorems in hypergraphs (2011) (10)
On the Maximum Quartet Distance between Phylogenetic Trees (2015) (10)
Monochromatic cycle covers in random graphs (2017) (10)
Completion and deficiency problems (2019) (10)
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs (2012) (10)
Hypergraph cuts above the average (2018) (10)
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs (2018) (10)
Erdős–Szekeres theorem for multidimensional arrays (2022) (10)
Ramsey goodness of paths (2015) (10)
Compatible Hamilton cycles in Dirac graphs (2014) (10)
On the number of edges not covered by monochromatic copies of a fixed graph (2004) (10)
Bounding the Number of Edges in Permutation Graphs (2006) (10)
A Construction of Almost Steiner Systems (2013) (9)
The number of Hamiltonian decompositions of regular graphs (2015) (9)
Most Probably Intersecting Hypergraphs (2013) (9)
Compatible Hamilton cycles in random graphs (2014) (9)
The Threshold Probability for Long Cycles (2014) (9)
Non-trivially intersecting multi-part families (2017) (9)
Counting Hamilton decompositions of oriented graphs (2016) (9)
Directed Ramsey number for trees (2017) (9)
Large subgraphs without complete bipartite graphs (2014) (9)
Coloring Random Graphs (1998) (9)
Ramsey numbers of cubes versus cliques (2012) (8)
Constrained Ramsey Numbers (2007) (8)
Regular induced subgraphs of a random Graph (2008) (8)
Proof of the Brown–Erdős–Sós conjecture in groups (2019) (8)
Monochromatic paths in random tournaments (2017) (8)
Hereditary quasirandomness without regularity (2016) (8)
Nowhere-Zero Flows in Random Graphs (2001) (8)
Counting and packing Hamilton -cycles in dense hypergraphs (2014) (8)
Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡} (2019) (8)
Directed Graphs Without Short Cycles (2008) (8)
Making a K_4-free graph bipartite (2007) (8)
The oriented size Ramsey number of directed paths (2017) (8)
Anagram-free colorings of graphs (2016) (8)
An extremal problem for integer sparse recovery (2019) (8)
Decomposing Random Graphs into Few Cycles and Edges (2014) (8)
Equiangular lines and spherical codes in Euclidean space (2017) (7)
Approximate Coloring of Uniform Hypergraphs (Extended Abstract) (1998) (7)
An average degree condition for independent transversals (2020) (7)
Generating all subsets of a finite set with disjoint unions (2008) (7)
On the number of monotone sequences (2014) (7)
Covering random graphs by monochromatic trees and Helly-type results for hypergraphs (2019) (7)
On the Largest Eigenvalue of a Random Subgraph of the Hypercube (2002) (7)
Three colour bipartite Ramsey number of cycles and paths (2018) (7)
On a restricted cross-intersection problem (2006) (7)
Hamiltonicity, independence number, and pancyclicity (2011) (6)
Short proofs of some extremal results III (2019) (6)
Large Induced Matchings in Random Graphs (2020) (6)
Anagram-Free Colourings of Graphs (2017) (6)
Long directed rainbow cycles and rainbow spanning trees (2017) (6)
Some Remarks on Rainbow Connectivity (2015) (6)
Ramsey Goodness of Bounded Degree Trees (2016) (6)
A Ramsey-type result for the hypercube (2006) (6)
Paths and Stability Number in Digraphs (2009) (6)
Decompositions into Subgraphs of Small Diameter (2009) (6)
Two-Sided, Unbiased Version of Hall's Marriage Theorem (2017) (6)
Two Remarks on Eventown and Oddtown Problems (2018) (5)
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs (2019) (5)
Disjoint Systems (1995) (5)
Tower-type bounds for unavoidable patterns in words (2017) (5)
Maximum union-free subfamilies (2010) (5)
Discrete Kakeya-type problems and small bases (2007) (5)
The randomk-matching-free process: KRIVELEVICHet al.. (2018) (5)
Number of 1-Factorizations of Regular High-Degree Graphs (2018) (5)
Swarming on Random Graphs II (2015) (5)
Resilience of graphs (2007) (5)
Bounded colorings of multipartite graphs and hypergraphs (2016) (5)
Asymptotically Optimal Tree-Packings in Regular Graphs (2001) (5)
Testing Equality in Communication Graphs (2016) (5)
Biased orientation games (2011) (5)
Flattening rank and its combinatorial applications (2021) (5)
Oblivious Collaboration (2011) (5)
Multicoloured extremal problems (2004) (5)
Supersaturation in posets and applications involving the container method (2016) (5)
Colouring set families without monochromatic k-chains (2018) (5)
Bandwidth theorem for sparse graphs (2010) (4)
Ramsey Goodness of Cycles (2018) (4)
Afew remarks on Ramsey-Turan-type problems (2003) (4)
Powers of paths in tournaments (2020) (4)
On the value of a random minimum length (2007) (4)
Equiangular Subspaces in Euclidean Spaces (2017) (4)
On the Strong Chromatic Number of Random Graphs (2007) (4)
Minimum saturated families of sets (2018) (4)
Short Proofs of Rainbow Matchings Results (2021) (4)
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming (2018) (4)
Getting a Directed Hamilton Cycle Two Times Faster (2011) (4)
Ramsey Numbers and the Size of Graphs (2007) (4)
On graphs with subgraphs having large independence numbers (2007) (4)
Cycles in graphs with large independence ratio (2011) (4)
Large Independent Sets from Local Considerations (2020) (3)
Ramsey number of 1-subdivisions of transitive tournaments (2021) (3)
The Turán number of the grid (2022) (3)
Isomorphic bisections of cubic graphs (2020) (3)
Essays in extremal combinatorics (2012) (3)
Clique minors in graphs with a forbidden subgraph (2020) (3)
Bounds for spherical codes (2016) (3)
Counting and packing Hamilton $\ell$-cycles in dense hypergraphs (2014) (3)
Monochromatic paths in random tournaments (2017) (3)
Comparable pairs in families of sets (2014) (3)
Counting odd cycle free orientations of graphs (2020) (3)
Discrepancy of random graphs and hypergraphs (2013) (3)
Long Monotone Trails in Random Edge-Labellings of Random Graphs (2018) (3)
Acyclic subgraphs of tournaments with high chromatic number (2019) (3)
Tight Ramsey bounds for multiple copies of a graph (2021) (3)
Approximate Version of Conjecture (2010) (3)
Lower Bounds for Max-Cut via Semidefinite Programming (2020) (2)
C4-free subgraphs with large average degree (2020) (2)
On Kahn's basis conjecture (2018) (2)
Domination in 3-tournaments (2016) (2)
Ramsey properties of algebraic graphs and hypergraphs (2021) (2)
Learning a Hidden Matching Combinatorial Identification of Hidden Matchings with Applications to (2002) (2)
Resolution of the Erd\H{o}s-Sauer problem on regular subgraphs (2022) (2)
Sidorenko's conjecture for a class of graphs: an exposition (2012) (2)
Independent arithmetic progressions (2019) (2)
Two extensions of Ramsey's theorem (2011) (2)
The Kőnig graph process (2020) (2)
Counting Hamilton cycles in sparse random directed graphs (2017) (2)
Asymptotics in bond percolation on expanders (2018) (2)
Edge-disjoint rainbow trees in properly coloured complete graphs (2017) (2)
Cycles of many lengths in Hamiltonian graphs (2021) (2)
On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs (2007) (2)
Erd\H{o}s-Szekeres theorem for multidimensional arrays (2019) (2)
Proof of Grinblat's conjecture on rainbow matchings in multigraphs (2021) (2)
Complete minors and average degree: A short proof (2022) (2)
Books versus Triangles at the Extremal Density (2019) (2)
Almost-Fisher families (2014) (2)
A remark on Hamilton cycles with few colors (2017) (2)
Evasive sets, covering by subspaces, and point-hyperplane incidences (2022) (2)
On a conjecture of Erdős and Simonovits: Even cycles (2013) (2)
Counting H-free orientations of graphs (2021) (2)
Proof of the Brown-Erd\H{o}s-S\'os conjecture in groups (2019) (1)
Unavoidable hypergraphs (2020) (1)
C O ] 1 7 Ju l 2 01 8 Monochromatic cycle covers in random graphs (2018) (1)
Two remarks on even and oddtown problems (2016) (1)
Monochromatic trees in random tournaments (2018) (1)
Universal and unavoidable graphs (2019) (1)
List oloring of random and pseudo-random graphsNoga (2007) (1)
The K\H{o}nig Graph Process (2019) (1)
Algebraic Methods in Combinatorics (2008) (1)
Tight bounds for powers of Hamilton cycles in tournaments (2021) (1)
A Note on τ-Critical Linear Hypergraphs (1997) (1)
2-factors with k cycles in Hamiltonian graphs (2019) (1)
Threshold Ramsey multiplicity for odd cycles (2021) (1)
Turán numbers of sunflowers (2022) (1)
Asymptotics of the hypergraph bipartite Tur\'an problem (2022) (1)
On the Local Resilience of Random Regular Graphs (2009) (1)
A conjecture of Erd\H{o}s on graph Ramsey numbers (2010) (1)
Uniform chain decompositions and applications (2019) (1)
Small subgraphs with large average degree (2022) (1)
Ramsey-type results for semi-algebraic relations Citation (2013) (1)
Nearly optimal embeddings of trees (2007) (1)
Long directed paths in Eulerian digraphs (2021) (1)
The number of Hamiltonian decompositions of regular graphs (2017) (1)
Musical Chairs (2012) (1)
Title An Approximate Version of Sidorenko ’ s Conjecture Permalink (2010) (1)
Small doubling, atomic structure and $\ell$-divisible set families (2021) (1)
Threshold Ramsey multiplicity for paths and even cycles (2021) (1)
Which graphs can be counted in $C_4$-free graphs? (2021) (1)
New results for MaxCut in $H$-free graphs (2021) (1)
Getting directed Hamilton cycle twice faster (2011) (1)
The n-queens completion problem (2021) (1)
Infinite Sperner's theorem (2020) (1)
Hamilton cycles in pseudorandom graphs (2023) (1)
Swarming on Random Graphs II (2014) (0)
University of Birmingham Counting Hamilton decompositions of oriented graphs (2017) (0)
Maximum union-free subfamilies (2012) (0)
C O ] 1 7 O ct 2 01 8 Halfway to Rota ’ s basis conjecture (2018) (0)
Bisections of graphs Choongbum Lee (2015) (0)
Nearly-linear monotone paths in edge-ordered graphs (2020) (0)
Ramsey numbers of cubes versus cliques Citation (2013) (0)
C O ] 1 0 N ov 2 00 7 Discrete Kakeya-type problems and small bases (2008) (0)
A Note on Powers of Paths in Tournaments (2020) (0)
Coloring graphs with sparse neighborhoodsNoga (1998) (0)
Cycles in triangle-free graphs of large chromatic number (2016) (0)
Disjoint Systems (Extended Abstract) (1993) (0)
Equiangular Subspaces in Euclidean Spaces (2018) (0)
A sharp threshold for network reliabilityMi (2007) (0)
Random regular graphs of high degreeMi hael (2007) (0)
C O ] 3 1 M ar 2 00 5 Pseudo-random graphs (2008) (0)
Graph Theory (2016) (0)
On the random satisfiable 3 CNF process (2007) (0)
C O ] 2 4 A pr 2 01 8 Minimum saturated families of sets (2018) (0)
Effective bounds for induced size-Ramsey numbers of cycles (2023) (0)
On Ramsey size-linear graphs and related questions (2022) (0)
Approximating oloring and maximum independent sets in 3-uniformhypergraphs (2001) (0)
C O ] 1 3 D ec 2 01 3 Ramsey numbers of cubes versus cliques (2013) (0)
2-2013 Self-Similarity of Graphs (2015) (0)
C O ] 1 7 O ct 2 01 8 On Kahn ’ s basis conjecture (2018) (0)
Cycle Packing Terms of Use Cycle Packing (2014) (0)
C O ] 1 3 M ay 2 01 9 Books versus triangles at the extremal density (2019) (0)
Regular subgraphs of linear hypergraphs (2022) (0)
Ju n 20 19 Non-trivially intersecting multi-part families (2019) (0)
The Tur\'an number of the grid (2022) (0)
Maximal k-Wise $$\ell $$-Divisible Set Families Are Atomic (2021) (0)
Small complete minors above the extremal edge density (2015) (0)
saturated bipartite graphs (2014) (0)
The Intersection Spectrum of 3-Chromatic Intersecting Hypergraphs (2020) (0)
Erd\H{o}s-Rademacher-type problems in extremal set theory: Sperner's Theorem (2013) (0)
3 N ov 2 01 5 Almost-Fisher families (2021) (0)
Probabilistic and Extremal Combinatorics Organizers (2009) (0)
C O ] 1 0 D ec 2 01 8 Dense induced bipartite subgraphs in triangle-free graphs (2018) (0)
Probabilistic Combinatorics: Recent Progress and New Frontiers (2005) (0)
2 Induced forests in sparse bipartite graphs (2013) (0)
Tournament Quasirandomness from Local Counting (2021) (0)
On graphs with subgraphs of large independence numbers (2007) (0)
The minimum number of disjoint pairs in set systems and related problems (2016) (0)
Compatible Hamilton cycles in Dirac graphs (2016) (0)
Orthonormal Representations of H-Free Graphs (2019) (0)
Bounded Degree Spanners of the Hypercube (2019) (0)
C O ] 3 0 A pr 2 01 9 Colouring set families without monochromatic k-chains (2019) (0)
Sparse pseudo-random graphs are (2002) (0)
Tur\'{a}n numbers of sunflowers (2021) (0)
On two problems in graph Ramsey theory (2012) (0)
J ul 2 01 9 Dense induced bipartite subgraphs in triangle-free graphs (2019) (0)
C O ] 2 1 N ov 2 01 9 UNIFORM CHAIN DECOMPOSITIONS AND APPLICATIONS (2019) (0)
BOUNDED-DEGREE SPANNING TREES IN RANDOMLY (2017) (0)
Maximal chordal subgraphs (2022) (0)
Ju n 20 07 Induced Ramsey-type theorems (2008) (0)
Equiangular lines and subspaces in Euclidean spaces (2017) (0)
Methods and Challenges in Extremal and Probabilistic Combinatorics ∗ Organizers (2015) (0)
A counterexample to the Alon-Saks-Seymour conjecture and related problems (2012) (0)
Additive Approximation for Edge-Deletion Problems (Abstract) (2006) (0)
On the Tur\'an number of the hypercube (2022) (0)
C O ] 2 7 O ct 2 01 8 Anticoncentration for subgraph statistics (2018) (0)
Large cliques and independent sets all over the place (2020) (0)
Ju n 20 07 Resilience of graphs (2007) (0)
Number of 1-Factorizations of Regular High-Degree Graphs (2020) (0)
THE ZERO FORCING NUMBER OF GRAPHS\ast (2019) (0)
Cycles in Sparse Graphs II (2010) (0)
C O ] 1 8 O ct 2 01 9 Short proofs of some extremal results III (2019) (0)
Ramsey numbers of cubes versus cliques (2014) (0)
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs (2020) (0)
Chv\'atal-Erd\H{o}s condition for pancyclicity (2023) (0)
Pancyclicity of Hamiltonian graphs (2022) (0)
A generalization of Bondy's pancyclicity theorem (2023) (0)
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz (2013) (0)
List colouring of graphs with at most $\big(2-o(1)\big)\chi$ vertices (2003) (0)
C O ] 2 6 O ct 2 01 4 Most probably intersecting hypergraphs (2021) (0)
On the densities of cliques and independent sets in graphs (2015) (0)
The intersection spectrum of 3‐chromatic intersecting hypergraphs (2022) (0)
A problem of Erd\H{o}s on the minimum number of $k$-cliques (2012) (0)
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (2017) (0)
J an 2 02 0 A proof of Ringel ’ s Conjecture (2020) (0)
LARGE INDUCED MATCHINGS IN RANDOM GRAPHS\ast (2021) (0)
The Minimum Degree Removal Lemma Thresholds (2023) (0)
C O ] 2 6 M ar 2 01 8 Colouring set families without monochromatic k-chains (2018) (0)
MAX CUT and the smallest eigenvalue ( Extended abstract ) (2002) (0)
Preface (2006) (0)

This paper list is powered by the following services:

Other Resources About Benny Sudakov

What Schools Are Affiliated With Benny Sudakov?

Benny Sudakov is affiliated with the following schools:

Image Attributions

Image Source for Benny Sudakov