Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenny Sudakov
Benjamin Sudakov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j231]Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov:
Asymptotics of the Hypergraph Bipartite Turán Problem. Comb. 43(3): 429-446 (2023)- [j230]Matija Bucic
, Benny Sudakov:
Large Independent Sets from Local Considerations. Comb. 43(3): 505-546 (2023) - [j229]David Conlon, Jacob Fox, Benny Sudakov, Fan Wei:
Threshold Ramsey multiplicity for paths and even cycles. Eur. J. Comb. 107: 103612 (2023) - [j228]Nemanja Draganic, David Munhá Correia, Benny Sudakov:
Tight bounds for powers of Hamilton cycles in tournaments. J. Comb. Theory, Ser. B 158(Part): 305-340 (2023) - [c18]Oliver Janzer, Benny Sudakov, István Tomon:
Small subgraphs with large average degree. SODA 2023: 2345-2353 - 2022
- [j227]Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Infinite Sperner's theorem. J. Comb. Theory, Ser. A 187: 105558 (2022) - [j226]Stefan Glock, Benny Sudakov:
An average degree condition for independent transversals. J. Comb. Theory, Ser. B 154: 370-391 (2022) - [j225]Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster:
Ramsey number of 1-subdivisions of transitive tournaments. J. Comb. Theory, Ser. B 157: 176-183 (2022) - [j224]Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Uniform chain decompositions and applications. Random Struct. Algorithms 60(2): 261-286 (2022) - [j223]Matija Bucic, Jacob Fox, Benny Sudakov:
Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms 60(3): 327-338 (2022) - 2021
- [j222]Matija Bucic, Eoin Long, Asaf Shapira, Benny Sudakov:
Tournament Quasirandomness from Local Counting. Comb. 41(2): 175-208 (2021) - [j221]Matija Bucic, Dániel Korándi, Benny Sudakov:
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. Comb. 41(3): 319-352 (2021) - [j220]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): 894-898 (2021) - [j219]Matija Bucic, Nemanja Draganic, Benny Sudakov:
Universal and unavoidable graphs. Comb. Probab. Comput. 30(6): 942-955 (2021) - [j218]Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran:
Unavoidable hypergraphs. J. Comb. Theory, Ser. B 151: 307-338 (2021) - [j217]Shagnik Das, Alexey Pokrovskiy, Benny Sudakov:
Isomorphic bisections of cubic graphs. J. Comb. Theory, Ser. B 151: 465-481 (2021) - [j216]Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov:
Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. 35(1): 267-280 (2021) - [j215]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): 1557-1568 (2021) - [i18]Stefan Glock, David Munhá Correia, Benny Sudakov:
The n-queens completion problem. CoRR abs/2111.11402 (2021) - 2020
- [j214]Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran:
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. Comb. 40(2): 283-305 (2020) - [j213]Asaf Ferber, Vishesh Jain, Benny Sudakov:
Number of 1-Factorizations of Regular High-Degree Graphs. Comb. 40(3): 315-344 (2020) - [j212]Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner:
Bounded Degree Spanners of the Hypercube. Electron. J. Comb. 27(3): 3 (2020) - [j211]Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion:
Long Monotone Trails in Random Edge-Labellings of Random Graphs. Comb. Probab. Comput. 29(1): 22-30 (2020) - [j210]Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov:
Monochromatic trees in random tournaments. Comb. Probab. Comput. 29(3): 318-345 (2020) - [j209]Igor Balla, Shoham Letzter, Benny Sudakov:
Orthonormal Representations of H-Free Graphs. Discret. Comput. Geom. 64(3): 654-670 (2020) - [j208]Frederik Benzing, Alexey Pokrovskiy, Benny Sudakov:
Long directed rainbow cycles and rainbow spanning trees. Eur. J. Comb. 88: 103102 (2020) - [j207]Shoham Letzter, Benny Sudakov:
The oriented size Ramsey number of directed paths. Eur. J. Comb. 88: 103103 (2020) - [j206]Matija Bucic, Erik Jahn, Alexey Pokrovskiy, Benny Sudakov:
2-factors with k cycles in Hamiltonian graphs. J. Comb. Theory, Ser. B 144: 150-166 (2020) - [j205]Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner:
Completion and deficiency problems. J. Comb. Theory, Ser. B 145: 214-240 (2020) - [j204]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Asymptotics in percolation on high-girth expanders. Random Struct. Algorithms 56(4): 927-947 (2020) - [j203]David Conlon, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results III. Random Struct. Algorithms 57(4): 958-982 (2020) - [j202]Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov:
The Kőnig graph process. Random Struct. Algorithms 57(4): 1272-1302 (2020) - [j201]David Conlon, Jacob Fox, Benny Sudakov:
Books versus Triangles at the Extremal Density. SIAM J. Discret. Math. 34(1): 385-398 (2020) - [j200]Alexey Pokrovskiy, Benny Sudakov:
Ramsey Goodness of Cycles. SIAM J. Discret. Math. 34(3): 1884-1908 (2020) - [c17]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN 2020: 479-490
2010 – 2019
- 2019
- [j199]Lenny Fukshansky, Deanna Needell, Benny Sudakov:
An algebraic perspective on integer sparse recovery. Appl. Math. Comput. 340: 31-42 (2019) - [j198]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. Comb. 39(6): 1351-1386 (2019) - [j197]Matija Bucic, Shoham Letzter, Benny Sudakov:
Multicolour Bipartite Ramsey Number of Paths. Electron. J. Comb. 26(3): 3 (2019) - [j196]Igor Balla, Benny Sudakov:
Equiangular Subspaces in Euclidean Spaces. Discret. Comput. Geom. 61(1): 81-90 (2019) - [j195]Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. J. Comb. Theory, Ser. B 137: 145-177 (2019) - [j194]Shagnik Das, Roman Glebov, Benny Sudakov, Tuan Tran:
Colouring set families without monochromatic k-chains. J. Comb. Theory, Ser. A 168: 84-119 (2019) - [j193]Matija Bucic, Shoham Letzter, Benny Sudakov:
3-Color bipartite Ramsey number of cycles and paths. J. Graph Theory 92(4): 445-459 (2019) - [j192]Matthew Kwan, Benny Sudakov, Tuan Tran:
Anticoncentration for subgraph statistics. J. Lond. Math. Soc. 99(3): 757-777 (2019) - [j191]Matija Bucic, Shoham Letzter, Benny Sudakov:
Monochromatic paths in random tournaments. Random Struct. Algorithms 54(1): 69-81 (2019) - [j190]Thomas Kalinowski, Nina Kamcev, Benny Sudakov:
The Zero Forcing Number of Graphs. SIAM J. Discret. Math. 33(1): 95-115 (2019) - [i17]Sergei Konyagin, Benny Sudakov:
An extremal problem for integer sparse recovery. CoRR abs/1904.08661 (2019) - 2018
- [j189]Igor Balla, Alexey Pokrovskiy, Benny Sudakov:
Ramsey Goodness of Bounded Degree Trees. Comb. Probab. Comput. 27(3): 289-309 (2018) - [j188]Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-Free Colourings of Graphs. Comb. Probab. Comput. 27(4): 623-642 (2018) - [j187]Alexey Pokrovskiy, Benny Sudakov:
Linearly many rainbow trees in properly edge-coloured complete graphs. J. Comb. Theory, Ser. B 132: 134-156 (2018) - [j186]Jonathan A. Noel, Alex Scott, Benny Sudakov:
Supersaturation in posets and applications involving the container method. J. Comb. Theory, Ser. A 154: 247-284 (2018) - [j185]Matthew Kwan, Benny Sudakov, Pedro Vieira:
Non-trivially intersecting multi-part families. J. Comb. Theory, Ser. A 156: 44-60 (2018) - [j184]Matthew Kwan, Benny Sudakov:
Intercalates and discrepancy in random Latin squares. Random Struct. Algorithms 52(2): 181-196 (2018) - [j183]Asaf Ferber, Matthew Kwan, Benny Sudakov:
Counting Hamilton cycles in sparse random directed graphs. Random Struct. Algorithms 53(4): 592-603 (2018) - [j182]Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov:
Monochromatic cycle covers in random graphs. Random Struct. Algorithms 53(4): 667-691 (2018) - [j181]Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov:
The random k-matching-free process. Random Struct. Algorithms 53(4): 692-716 (2018) - [j180]Benny Sudakov, Pedro Vieira:
Two Remarks on Eventown and Oddtown Problems. SIAM J. Discret. Math. 32(1): 280-295 (2018) - [c16]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. SODA 2018: 849-866 - 2017
- [j179]Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte:
Cycles in triangle-free graphs of large chromatic number. Comb. 37(3): 481-494 (2017) - [j178]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in Dirac graphs. Comb. 37(4): 697-732 (2017) - [j177]Benny Sudakov, Jacques Verstraëte:
The Extremal Function for Cycles of Length l mod k. Electron. J. Comb. 24(1): 1 (2017) - [j176]Roman Glebov, Humberto Naves, Benny Sudakov:
The Threshold Probability for Long Cycles. Comb. Probab. Comput. 26(2): 208-247 (2017) - [j175]Nina Kamcev, Benny Sudakov, Jan Volec:
Bounded colorings of multipartite graphs and hypergraphs. Eur. J. Comb. 66: 235-249 (2017) - [j174]Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov:
Equiangular lines and subspaces in Euclidean spaces. Electron. Notes Discret. Math. 61: 85-91 (2017) - [j173]Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. Electron. Notes Discret. Math. 61: 169-175 (2017) - [j172]Matija Bucic, Shoham Letzter, Benny Sudakov:
Monochromatic paths in random tournaments. Electron. Notes Discret. Math. 61: 177-183 (2017) - [j171]Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-free colorings of graphs. Electron. Notes Discret. Math. 61: 671-677 (2017) - [j170]Alexey Pokrovskiy, Benny Sudakov:
Edge-disjoint rainbow trees in properly coloured complete graphs. Electron. Notes Discret. Math. 61: 995-1001 (2017) - [j169]Asaf Ferber, Michael Krivelevich, Benny Sudakov:
Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory, Ser. B 122: 196-220 (2017) - [j168]David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ordered Ramsey numbers. J. Comb. Theory, Ser. B 122: 353-383 (2017) - [j167]Alexey Pokrovskiy, Benny Sudakov:
Ramsey goodness of paths. J. Comb. Theory, Ser. B 122: 384-390 (2017) - [j166]Benny Sudakov, Jan Volec:
Properly colored and rainbow copies of graphs with few cherries. J. Comb. Theory, Ser. B 122: 391-416 (2017) - [j165]Dániel Korándi, Benny Sudakov:
Domination in 3-tournaments. J. Comb. Theory, Ser. A 146: 165-168 (2017) - [j164]Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50(1): 71-85 (2017) - [j163]Dániel Korándi, Benny Sudakov:
Saturation in random graphs. Random Struct. Algorithms 51(1): 169-181 (2017) - [j162]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. SIAM J. Discret. Math. 31(1): 155-171 (2017) - [j161]Eli Shamir, Benny Sudakov:
Two-Sided, Unbiased Version of Hall's Marriage Theorem. Am. Math. Mon. 124(1): 79-80 (2017) - [j160]Noga Alon, Klim Efremenko, Benny Sudakov:
Testing Equality in Communication Graphs. IEEE Trans. Inf. Theory 63(11): 7569-7574 (2017) - [c15]Benny Sudakov:
Robustness of graph properties. BCC 2017: 372-408 - [i16]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. CoRR abs/1707.06212 (2017) - 2016
- [j159]David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ramsey numbers of cubes versus cliques. Comb. 36(1): 37-70 (2016) - [j158]Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the densities of cliques and independent sets in graphs. Comb. 36(5): 493-512 (2016) - [j157]Shagnik Das, Wenying Gan, Benny Sudakov:
The minimum number of disjoint pairs in set systems and related problems. Comb. 36(6): 623-660 (2016) - [j156]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Comb. Probab. Comput. 25(6): 909-927 (2016) - [j155]David Conlon, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results II. J. Comb. Theory, Ser. B 121: 173-196 (2016) - [j154]Shagnik Das, Benny Sudakov, Pedro Vieira:
Almost-Fisher families. J. Comb. Theory, Ser. A 138: 175-207 (2016) - [j153]Nina Kamcev, Michael Krivelevich, Benny Sudakov:
Some Remarks on Rainbow Connectivity. J. Graph Theory 83(4): 372-383 (2016) - [j152]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Judicious partitions of directed graphs. Random Struct. Algorithms 48(1): 147-170 (2016) - [j151]Dan Hefetz, Angelika Steger, Benny Sudakov:
Random directed graphs are robustly Hamiltonian. Random Struct. Algorithms 49(2): 345-362 (2016) - [j150]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in random graphs. Random Struct. Algorithms 49(3): 533-557 (2016) - [j149]Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms 49(4): 635-668 (2016) - [j148]Dániel Korándi, Yuval Peled, Benny Sudakov:
A Random Triadic Process. SIAM J. Discret. Math. 30(1): 1-19 (2016) - [j147]Noga Alon, Humberto Naves, Benny Sudakov:
On the Maximum Quartet Distance between Phylogenetic Trees. SIAM J. Discret. Math. 30(2): 718-735 (2016) - [c14]Noga Alon, Humberto Naves, Benny Sudakov:
On the maximum quartet distance between phylogenetic trees. SODA 2016: 2095-2106 - [i15]Noga Alon, Klim Efremenko, Benny Sudakov:
Testing Equality in Communication Graphs. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j146]Asaf Shapira, Benny Sudakov:
Small complete minors above the extremal edge density. Comb. 35(1): 75-94 (2015) - [j145]Shagnik Das, Benny Sudakov:
Most Probably Intersecting Hypergraphs. Electron. J. Comb. 22(1): 1 (2015) - [j144]Wenying Gan, Po-Shen Loh, Benny Sudakov:
Maximizing the Number of Independent Sets of a Fixed Size. Comb. Probab. Comput. 24(3): 521-527 (2015) - [j143]Shagnik Das, Wenying Gan, Benny Sudakov:
Sperner's Theorem and a Problem of Erdős, Katona and Kleitman. Comb. Probab. Comput. 24(4): 585-608 (2015) - [j142]Dániel Korándi, Michael Krivelevich, Benny Sudakov:
Decomposing Random Graphs into Few Cycles and Edges. Comb. Probab. Comput. 24(6): 857-872 (2015) - [j141]Wenying Gan, Dániel Korándi, Benny Sudakov:
Ks, t-saturated bipartite graphs. Eur. J. Comb. 45: 12-20 (2015) - [j140]Nina Kamcev, Michael Krivelevich, Benny Sudakov:
Some Remarks on Rainbow Connectivity. Electron. Notes Discret. Math. 49: 123-131 (2015) - [j139]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electron. Notes Discret. Math. 49: 181-187 (2015) - [j138]Dániel Korándi, Yuval Peled, Benny Sudakov:
A random triadic process. Electron. Notes Discret. Math. 49: 189-196 (2015) - [j137]Shagnik Das, Benny Sudakov, Pedro Vieira:
Almost-Fisher families. Electron. Notes Discret. Math. 49: 293-300 (2015) - [j136]Benny Sudakov, Jan Volec:
Properly colored and rainbow copies of graphs with few cherries. Electron. Notes Discret. Math. 49: 315-321 (2015) - [j135]Wojciech Samotij, Benny Sudakov:
On the number of monotone sequences. J. Comb. Theory, Ser. B 115: 132-163 (2015) - [j134]Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov:
Comparable pairs in families of sets. J. Comb. Theory, Ser. B 115: 164-185 (2015) - [j133]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 46(2): 320-345 (2015) - [j132]Jie Ma, Humberto Naves, Benny Sudakov:
Discrepancy of random graphs and hypergraphs. Random Struct. Algorithms 47(1): 147-162 (2015) - [p1]David Conlon, Jacob Fox, Benny Sudakov:
Recent developments in graph Ramsey theory. Surveys in Combinatorics 2015: 49-118 - [i14]Noga Alon, Humberto Naves, Benny Sudakov:
On the maximum quartet distance between phylogenetic trees. CoRR abs/1505.04344 (2015) - 2014
- [j131]Roman Glebov, Benny Sudakov, Tibor Szabó:
How Many Colors Guarantee a Rainbow Matching? Electron. J. Comb. 21(1): 1 (2014) - [j130]Hao Huang, Benny Sudakov:
The Minimum Number of Nonnegative Edges in Hypergraphs. Electron. J. Comb. 21(3): 3 (2014) - [j129]David Conlon, Jacob Fox, Benny Sudakov:
Short Proofs of Some Extremal Results. Comb. Probab. Comput. 23(1): 8-28 (2014) - [j128]Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte:
Turán numbers of bipartite graphs plus an odd cycle. J. Comb. Theory, Ser. B 106: 134-162 (2014) - [j127]Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the 3-Local Profiles of Graphs. J. Graph Theory 76(3): 236-248 (2014) - [j126]David Conlon, Jacob Fox, Benny Sudakov:
Cycle packing. Random Struct. Algorithms 45(4): 608-626 (2014) - [j125]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Musical Chairs. SIAM J. Discret. Math. 28(3): 1578-1600 (2014) - 2013
- [j124]Nathaniel Parrish, Benjamin Sudakov, Eleazar Eskin:
Genome reassembly with high-throughput sequencing data. BMC Genom. 14(S-1): S8 (2013) - [j123]Jacob Fox, Choongbum Lee, Benny Sudakov:
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. Comb. 33(2): 181-197 (2013) - [j122]Peter Keevash, Benny Sudakov, Jacques Verstraëte:
On a conjecture of Erdős and Simonovits: Even cycles. Comb. 33(6): 699-732 (2013) - [j121]Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov, Raphael Yuster:
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. Comb. Probab. Comput. 22(6): 859-873 (2013) - [j120]David Conlon, Jacob Fox, Benny Sudakov:
An improved bound for the stepping-up lemma. Discret. Appl. Math. 161(9): 1191-1196 (2013) - [j119]Shagnik Das, Choongbum Lee, Benny Sudakov:
Rainbow Turán problem for even cycles. Eur. J. Comb. 34(5): 905-915 (2013) - [j118]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-pairs shortest paths in O(n2) time with high probability. J. ACM 60(4): 26:1-26:25 (2013) - [j117]