Publications (303)
The ErdÅs-Gyárfás problem on generalized Ramsey numbers
David Conlon, Jacob Fox, Choongbum Lee +1
Additive approximation for edge-deletion problems
Noga Alon, Asaf Shapira, Benny Sudakov
Non-trivially intersecting multi-part families
Matthew Kwan, Benny Sudakov, Pedro Vieira
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
On a conjecture of Erdos and Simonovits: Even Cycles
Peter Keevash, Benny Sudakov, Jacques Verstraete
Small doubling, atomic structure and $\ell$-divisible set families
Lior Gishboliner, Benny Sudakov, István Tomon
A counterexample to Stein's Equi-n-square Conjecture
Alexey Pokrovskiy, Benny Sudakov
Zero forcing number of graphs
Thomas Kalinowski, Nina KamÄev, Benny Sudakov
Bandwidth theorem for random graphs
Hao Huang, Choongbum Lee, Benny Sudakov
Gaussian random graphs and Ramsey numbers
Zach Hunter, Aleksa MilojeviÄ, Benny Sudakov
Dense induced bipartite subgraphs in triangle-free graphs
Matthew Kwan, Shoham Letzter, Benny Sudakov +1
The Turán number of the grid
Domagoj BradaÄ, Oliver Janzer, Benny Sudakov +1
Nearly-uniform degree distributions in spanning subgraphs
Richard Montgomery, Alexey Pokrovskiy, Benny Sudakov
The size of a hypergraph and its matching number
Hao Huang, Po-Shen Loh, Benny Sudakov
On the Turán number of the hypercube
Oliver Janzer, Benny Sudakov
Ordered Ramsey numbers of graphs with $m$ edges
Domagoj BradaÄ, Patryk Morawski, Benny Sudakov +1
On graphs with subgraphs of large independence numbers
Noga Alon, Benny Sudakov
Packing Hamilton Cycles Online
Joseph Briggs, Alan Frieze, Michael Krivelevich +2
Anagram-free colorings of graphs
Nina KamÄev, Tomasz Åuczak, Benny Sudakov
Musical chairs
Yehuda Afek, Yakov Babichenko, Uriel Feige +3
Communication Complexity of Disjointness under Product Distributions
Zach Hunter, Aleksa MilojeviÄ, Benny Sudakov +1
The game chromatic number of random graphs
Tom Bohman, Alan Frieze, Benny Sudakov
An average degree condition for independent transversals
Stefan Glock, Benny Sudakov
Cycle lengths in sparse graphs
Benny Sudakov, Jacques Verstraete
Flattening rank and its combinatorial applications
David Munhá Correia, Benny Sudakov, István Tomon
KÅvári-Sós-Turán theorem for hereditary families
Zach Hunter, Aleksa MilojeviÄ, Benny Sudakov +1
Number of 1-factorizations of regular high-degree graphs
Asaf Ferber, Vishesh Jain, Benny Sudakov
Saturation in Random Hypergraphs
Sahar Diskin, Ilay Hoshen, Dániel Korándi +2
Long monotone trails in random edge-labelings of random graphs
Omer Angel, Asaf Ferber, Benny Sudakov +1
The phase transition in random graphs - a simple proof
Michael Krivelevich, Benny Sudakov
The number of Hamiltonian decompositions of regular graphs
Roman Glebov, Zur Luria, Benny Sudakov
Finding paths in sparse random graphs requires many queries
Asaf Ferber, Michael Krivelevich, Benny Sudakov +1
Ramsey numbers of sparse hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
Economic Censorship Games in Fraud Proofs
Ben Berger, Edward W. Felten, Akaki Mamageishvili +1
Rainbow Turán Problem for Even Cycles
Shagnik Das, Choongbum Lee, Benny Sudakov
Counting subgraphs in locally dense graphs
Domagoj BradaÄ, Benny Sudakov, Yuval Wigderson
Covering graphs by monochromatic trees and Helly-type results for hypergraphs
Matija BuciÄ, Dániel Korándi, Benny Sudakov
Chromatic number, clique subdivisions, and the conjectures of Hajós and ErdÅs-Fajtlowicz
Jacob Fox, Choongbum Lee, Benny Sudakov
Ascending Subgraph Decomposition
Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy +1
Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
Nemanja DraganiÄ, Jaehoon Kim, Hyunwoo Lee +3
Books versus triangles at the extremal density
David Conlon, Jacob Fox, Benny Sudakov
Long directed rainbow cycles and rainbow spanning trees
Frederik Benzing, Alexey Pokrovskiy, Benny Sudakov
Linearly many rainbow trees in properly edge-coloured complete graphs
Alexey Pokrovskiy, Benny Sudakov
Sunflowers and Ramsey problems for restricted intersections
Barnabás Janzer, Zhihan Jin, Benny Sudakov +1
Note on the second eigenvalue of regular graphs
Igor Balla, Eero Räty, Benny Sudakov +1
Nearly Hamilton cycles in sublinear expanders, and applications
Shoham Letzter, Abhishek Methuku, Benny Sudakov
Hypergraph cuts above the average
David Conlon, Jacob Fox, Matthew Kwan +1
Incidence bounds via extremal graph theory
Aleksa MilojeviÄ, István Tomon, Benny Sudakov
The minimum number of nonnegative edges in hypergraphs
Hao Huang, Benny Sudakov
Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming
Charles Carlson, Alexandra Kolla, Ray Li +3
Sperner's Theorem and a Problem of Erdos-Katona-Kleitman
Shagnik Das, Wenying Gan, Benny Sudakov
On the Probability a Weighted Bernoulli Sum Exceeds Its Mean
Aleksa Milojevic, Benny Sudakov
Large subgraphs without complete bipartite graphs
David Conlon, Jacob Fox, Benny Sudakov
Infinite Sperner's theorem
Benny Sudakov, István Tomon, Adam Zsolt Wagner
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
Hao Huang, Jie Ma, Asaf Shapira +2
Counting Hamilton decompositions of oriented graphs
Asaf Ferber, Eoin Long, Benny Sudakov
Self-similarity of graphs
Choongbum Lee, Po-Shen Loh, Benny Sudakov
Erdos-Hajnal-type theorems in hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
Hamilton cycles in pseudorandom graphs
Stefan Glock, David Munhá Correia, Benny Sudakov
Cycles and matchings in randomly perturbed digraphs and hypergraphs
Michael Krivelevich, Matthew Kwan, Benny Sudakov
How many random edges make a dense hypergraph non-2-colorable?
Benny Sudakov, Jan Vondrak
Approximate path decompositions of regular graphs
Richard Montgomery, Alp Müyesser, Alexey Pokrovskiy +1
On Ramsey size-linear graphs and related questions
Domagoj BradaÄ, Lior Gishboliner, Benny Sudakov
The Minimum Degree Removal Lemma Thresholds
Lior Gishboliner, Zhihan Jin, Benny Sudakov
The minimum number of disjoint pairs in set systems and related problems
Shagnik Das, Wenying Gan, Benny Sudakov
Maximizing the number of independent sets of a fixed size
Wenying Gan, Po-Shen Loh, Benny Sudakov
Avoiding small subgraphs in Achlioptas processes
Michael Krivelevich, Po-Shen Loh, Benny Sudakov
Supersaturation in Posets and Applications Involving the Container Method
Jonathan A. Noel, Alex Scott, Benny Sudakov
A construction of almost Steiner systems
Asaf Ferber, Rani Hod, Michael Krivelevich +1
Erdos-Szekeres-type theorems for monotone paths and convex bodies
Jacob Fox, Janos Pach, Benny Sudakov +1
Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels
Noga Alon, Peter Frankl, Hao Huang +3
Distinguishability threshold for random geometric graphs
Zach Hunter, Aleksa MilojeviÄ, Benny Sudakov
Nearly-linear monotone paths in edge-ordered graphs
Matija Bucic, Matthew Kwan, Alexey Pokrovskiy +3
Longest cycles in sparse random digraphs
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
Discrete Kakeya-type problems and small bases
Noga Alon, Boris Bukh, Benny Sudakov
Coloring small locally sparse degenerate graphs and related problems
Domagoj BradaÄ, Jacob Fox, Raphael Steiner +2
Canonical Ramsey numbers of sparse graphs
Lior Gishboliner, Aleksa MilojeviÄ, Benny Sudakov +1
Orthonormal representations of $H$-free graphs
Igor Balla, Shoham Letzter, Benny Sudakov
The Cost of Secure Restaking vs. Proof-of-Stake
Akaki Mamageishvili, Benny Sudakov
Chromatic number and regular subgraphs
Barnabás Janzer, Raphael Steiner, Benny Sudakov
The Helly number of Hamming balls and related problems
Noga Alon, Zhihan Jin, Benny Sudakov
Short proofs of some extremal results III
David Conlon, Jacob Fox, Benny Sudakov
Properly colored and rainbow copies of graphs with few cherries
Benny Sudakov, Jan Volec
Oblivious Collaboration
Yehuda Afek, Yakov Babichenko, Uriel Feige +3
Biased orientation games
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
Compatible Hamilton cycles in random graphs
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Ramsey numbers of cubes versus cliques
David Conlon, Jacob Fox, Choongbum Lee +1
Hamiltonicity, independence number, and pancyclicity
Choongbum Lee, Benny Sudakov
Bounded Degree Spanners of the Hypercube
Rajko Nenadov, Mehtaab Sawhney, Benny Sudakov +1
Most Probably Intersecting Hypergraphs
Shagnik Das, Benny Sudakov
On the 3-local profiles of graphs
Hao Huang, Nati Linial, Humberto Naves +2
Supercritical sharpness of percolation
Sahar Diskin, Philip Easo, Ritvik Ramanan Radhakrishnan +2
THe largest eigenvalue of sparse random graphs
Michael Krivelevich, Benny Sudakov
Proof of Grinblat's conjecture on rainbow matchings in multigraphs
David Munhá Correia, Benny Sudakov
A conjecture of ErdÅs on graph Ramsey numbers
Benny Sudakov
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty +2
Ramsey-type problem for an almost monochromatic K_4
Jacob Fox, Benny Sudakov
Ramsey goodness of cycles
Alexey Pokrovskiy, Benny Sudakov
On the Largest Eigenvalue of a Random Subgraph of the Hypercube
Alexander Soshnikov, Benny Sudakov
Hamiltonicity thresholds in Achlioptas processes
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov