Benny Sudakov

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 119

Top Venues

Random Struct. Algorithms

J. Comb. Theory, Ser. B

Comb.

Comb. Probab. Comput.

Publications

Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty, David Munhá Correia, Benny Sudakov
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs. CoRR (2024)
Lior Gishboliner, Zhihan Jin, Benny Sudakov
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs. Comb. 44 (3) (2024)
Lior Gishboliner, Zhihan Jin, Benny Sudakov
The minimum degree removal lemma thresholds. J. Comb. Theory B 166 (2024)
Domagoj Bradac, Lior Gishboliner, Benny Sudakov
On Ramsey Size-Linear Graphs and Related Questions. SIAM J. Discret. Math. 38 (1) (2024)
Akaki Mamageishvili, Christoph Schlegel, Benny Sudakov, Danning Sui
Searcher Competition in Block Building. CoRR (2024)
Oliver Janzer, Benny Sudakov, István Tomon
Small Subgraphs with Large Average Degree. Comb. 44 (4) (2024)
Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov
Asymptotics of the Hypergraph Bipartite Turán Problem. Comb. 43 (3) (2023)
Oliver Janzer, Benny Sudakov, István Tomon
Small subgraphs with large average degree. SODA (2023)
Lior Gishboliner, Benny Sudakov
Maximal chordal subgraphs. Comb. Probab. Comput. 32 (5) (2023)
Noga Alon, Michael Krivelevich, Benny Sudakov
Complete minors and average degree: A short proof. J. Graph Theory 103 (3) (2023)
Benny Sudakov, István Tomon
Matrix discrepancy and the log-rank conjecture. CoRR (2023)
David Conlon, Jacob Fox, Benny Sudakov, Fan Wei
Threshold Ramsey multiplicity for paths and even cycles. Eur. J. Comb. 107 (2023)
Matija Bucic, Benny Sudakov
Large Independent Sets from Local Considerations. Comb. 43 (3) (2023)
Nemanja Draganic, David Munhá Correia, Benny Sudakov
Tight bounds for powers of Hamilton cycles in tournaments. J. Comb. Theory, Ser. B 158 (Part) (2023)
Benny Sudakov, István Tomon, Adam Zsolt Wagner
Uniform chain decompositions and applications. Random Struct. Algorithms 60 (2) (2022)
Stefan Glock, Benny Sudakov
An average degree condition for independent transversals. J. Comb. Theory, Ser. B 154 (2022)
Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster
Ramsey number of 1-subdivisions of transitive tournaments. J. Comb. Theory, Ser. B 157 (2022)
Matija Bucic, Jacob Fox, Benny Sudakov
Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms 60 (3) (2022)
Benny Sudakov, István Tomon, Adam Zsolt Wagner
Infinite Sperner's theorem. J. Comb. Theory, Ser. A 187 (2022)
Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov
Powers of paths in tournaments. Comb. Probab. Comput. 30 (6) (2021)
Stefan Glock, David Munhá Correia, Benny Sudakov
The n-queens completion problem. CoRR (2021)
Matija Bucic, Nemanja Draganic, Benny Sudakov
Universal and unavoidable graphs. Comb. Probab. Comput. 30 (6) (2021)
Matija Bucic, Dániel Korándi, Benny Sudakov
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. Comb. 41 (3) (2021)
Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran
Unavoidable hypergraphs. J. Comb. Theory, Ser. B 151 (2021)
Matija Bucic, Eoin Long, Asaf Shapira, Benny Sudakov
Tournament Quasirandomness from Local Counting. Comb. 41 (2) (2021)
Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov
Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. 35 (1) (2021)
Shagnik Das, Alexey Pokrovskiy, Benny Sudakov
Isomorphic bisections of cubic graphs. J. Comb. Theory, Ser. B 151 (2021)
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35 (3) (2021)
Igor Balla, Shoham Letzter, Benny Sudakov
Orthonormal Representations of H-Free Graphs. Discret. Comput. Geom. 64 (3) (2020)
Asaf Ferber, Vishesh Jain, Benny Sudakov
Number of 1-Factorizations of Regular High-Degree Graphs. Comb. 40 (3) (2020)
Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov
Monochromatic trees in random tournaments. Comb. Probab. Comput. 29 (3) (2020)
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN (2020)
Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. Comb. 40 (2) (2020)
Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner
Bounded Degree Spanners of the Hypercube. Electron. J. Comb. 27 (3) (2020)
Frederik Benzing, Alexey Pokrovskiy, Benny Sudakov
Long directed rainbow cycles and rainbow spanning trees. Eur. J. Comb. 88 (2020)
Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion
Long Monotone Trails in Random Edge-Labellings of Random Graphs. Comb. Probab. Comput. 29 (1) (2020)
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
Asymptotics in percolation on high-girth expanders. Random Struct. Algorithms 56 (4) (2020)
Shoham Letzter, Benny Sudakov
The oriented size Ramsey number of directed paths. Eur. J. Comb. 88 (2020)
David Conlon, Jacob Fox, Benny Sudakov
Short proofs of some extremal results III. Random Struct. Algorithms 57 (4) (2020)
Matija Bucic, Erik Jahn, Alexey Pokrovskiy, Benny Sudakov
cycles in Hamiltonian graphs. J. Comb. Theory, Ser. B 144 (2020)
Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov
The Kőnig graph process. Random Struct. Algorithms 57 (4) (2020)
Alexey Pokrovskiy, Benny Sudakov
Ramsey Goodness of Cycles. SIAM J. Discret. Math. 34 (3) (2020)
David Conlon, Jacob Fox, Benny Sudakov
Books versus Triangles at the Extremal Density. SIAM J. Discret. Math. 34 (1) (2020)
Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner
Completion and deficiency problems. J. Comb. Theory, Ser. B 145 (2020)
Martin Nägele, Benny Sudakov, Rico Zenklusen
Submodular Minimization Under Congruency Constraints. Comb. 39 (6) (2019)
Matija Bucic, Shoham Letzter, Benny Sudakov
3-Color bipartite Ramsey number of cycles and paths. J. Graph Theory 92 (4) (2019)
Matthew Kwan, Benny Sudakov, Tuan Tran
Anticoncentration for subgraph statistics. J. Lond. Math. Soc. 99 (3) (2019)
Sergei Konyagin, Benny Sudakov
An extremal problem for integer sparse recovery. CoRR (2019)
Matija Bucic, Shoham Letzter, Benny Sudakov
Monochromatic paths in random tournaments. Random Struct. Algorithms 54 (1) (2019)
Lenny Fukshansky, Deanna Needell, Benny Sudakov
An algebraic perspective on integer sparse recovery. Appl. Math. Comput. 340 (2019)
Igor Balla, Benny Sudakov
Equiangular Subspaces in Euclidean Spaces. Discret. Comput. Geom. 61 (1) (2019)
Matija Bucic, Shoham Letzter, Benny Sudakov
Directed Ramsey number for trees. J. Comb. Theory, Ser. B 137 (2019)
Shagnik Das, Roman Glebov, Benny Sudakov, Tuan Tran
-chains. J. Comb. Theory, Ser. A 168 (2019)
Matija Bucic, Shoham Letzter, Benny Sudakov
Multicolour Bipartite Ramsey Number of Paths. Electron. J. Comb. 26 (3) (2019)
Thomas Kalinowski, Nina Kamcev, Benny Sudakov
The Zero Forcing Number of Graphs. SIAM J. Discret. Math. 33 (1) (2019)
Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov
Monochromatic cycle covers in random graphs. Random Struct. Algorithms 53 (4) (2018)
Jonathan A. Noel, Alex Scott, Benny Sudakov
Supersaturation in posets and applications involving the container method. J. Comb. Theory, Ser. A 154 (2018)
Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov
The random k-matching-free process. Random Struct. Algorithms 53 (4) (2018)
Nina Kamcev, Tomasz Luczak, Benny Sudakov
Anagram-Free Colourings of Graphs. Comb. Probab. Comput. 27 (4) (2018)
Alexey Pokrovskiy, Benny Sudakov
Linearly many rainbow trees in properly edge-coloured complete graphs. J. Comb. Theory, Ser. B 132 (2018)
Matthew Kwan, Benny Sudakov, Pedro Vieira
Non-trivially intersecting multi-part families. J. Comb. Theory, Ser. A 156 (2018)
Asaf Ferber, Matthew Kwan, Benny Sudakov
Counting Hamilton cycles in sparse random directed graphs. Random Struct. Algorithms 53 (4) (2018)
Benny Sudakov, Pedro Vieira
Two Remarks on Eventown and Oddtown Problems. SIAM J. Discret. Math. 32 (1) (2018)
Igor Balla, Alexey Pokrovskiy, Benny Sudakov
Ramsey Goodness of Bounded Degree Trees. Comb. Probab. Comput. 27 (3) (2018)
Martin Nägele, Benny Sudakov, Rico Zenklusen
Submodular Minimization Under Congruency Constraints. SODA (2018)
Matthew Kwan, Benny Sudakov
Intercalates and discrepancy in random Latin squares. Random Struct. Algorithms 52 (2) (2018)
Noga Alon, Klim Efremenko, Benny Sudakov
Testing Equality in Communication Graphs. IEEE Trans. Inf. Theory 63 (11) (2017)
Roman Glebov, Humberto Naves, Benny Sudakov
The Threshold Probability for Long Cycles. Comb. Probab. Comput. 26 (2) (2017)
Eli Shamir, Benny Sudakov
Two-Sided, Unbiased Version of Hall's Marriage Theorem. Am. Math. Mon. 124 (1) (2017)
Matija Bucic, Shoham Letzter, Benny Sudakov
Monochromatic paths in random tournaments. Electron. Notes Discret. Math. 61 (2017)
Matija Bucic, Shoham Letzter, Benny Sudakov
Directed Ramsey number for trees. Electron. Notes Discret. Math. 61 (2017)
Benny Sudakov, Jacques Verstraëte
The Extremal Function for Cycles of Length l mod k. Electron. J. Comb. 24 (1) (2017)
Alexey Pokrovskiy, Benny Sudakov
Ramsey goodness of paths. J. Comb. Theory, Ser. B 122 (2017)
David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
Ordered Ramsey numbers. J. Comb. Theory, Ser. B 122 (2017)
Nina Kamcev, Benny Sudakov, Jan Volec
Bounded colorings of multipartite graphs and hypergraphs. Eur. J. Comb. 66 (2017)
Dániel Korándi, Benny Sudakov
Domination in 3-tournaments. J. Comb. Theory, Ser. A 146 (2017)
Asaf Ferber, Michael Krivelevich, Benny Sudakov
Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory, Ser. B 122 (2017)
Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov
Equiangular lines and subspaces in Euclidean spaces. Electron. Notes Discret. Math. 61 (2017)
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. SIAM J. Discret. Math. 31 (1) (2017)
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Compatible Hamilton cycles in Dirac graphs. Comb. 37 (4) (2017)
Benny Sudakov
Robustness of graph properties. BCC (2017)
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50 (1) (2017)
Martin Nägele, Benny Sudakov, Rico Zenklusen
Submodular Minimization Under Congruency Constraints. CoRR (2017)
Benny Sudakov, Jan Volec
Properly colored and rainbow copies of graphs with few cherries. J. Comb. Theory, Ser. B 122 (2017)
Alexey Pokrovskiy, Benny Sudakov
Edge-disjoint rainbow trees in properly coloured complete graphs. Electron. Notes Discret. Math. 61 (2017)
Nina Kamcev, Tomasz Luczak, Benny Sudakov
Anagram-free colorings of graphs. Electron. Notes Discret. Math. 61 (2017)
Dániel Korándi, Benny Sudakov
Saturation in random graphs. Random Struct. Algorithms 51 (1) (2017)
Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte
Cycles in triangle-free graphs of large chromatic number. Comb. 37 (3) (2017)
David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
Ramsey numbers of cubes versus cliques. Comb. 36 (1) (2016)
Shagnik Das, Wenying Gan, Benny Sudakov
The minimum number of disjoint pairs in set systems and related problems. Comb. 36 (6) (2016)
David Conlon, Jacob Fox, Benny Sudakov
Short proofs of some extremal results II. J. Comb. Theory, Ser. B 121 (2016)
Dan Hefetz, Angelika Steger, Benny Sudakov
Random directed graphs are robustly Hamiltonian. Random Struct. Algorithms 49 (2) (2016)
Michael Krivelevich, Choongbum Lee, Benny Sudakov
Compatible Hamilton cycles in random graphs. Random Struct. Algorithms 49 (3) (2016)
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms 49 (4) (2016)
Noga Alon, Humberto Naves, Benny Sudakov
On the maximum quartet distance between phylogenetic trees. SODA (2016)
Shagnik Das, Benny Sudakov, Pedro Vieira
Almost-Fisher families. J. Comb. Theory, Ser. A 138 (2016)
Noga Alon, Humberto Naves, Benny Sudakov
On the Maximum Quartet Distance between Phylogenetic Trees. SIAM J. Discret. Math. 30 (2) (2016)
Nina Kamcev, Michael Krivelevich, Benny Sudakov
Some Remarks on Rainbow Connectivity. J. Graph Theory 83 (4) (2016)
Michael Krivelevich, Matthew Kwan, Benny Sudakov
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Comb. Probab. Comput. 25 (6) (2016)
Choongbum Lee, Po-Shen Loh, Benny Sudakov
Judicious partitions of directed graphs. Random Struct. Algorithms 48 (1) (2016)

Benny Sudakov.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Benny Sudakov