pith. sign in

Benny Sudakov

Identifiers

  • name variant Benny Sudakov 0.60 · backfill

Papers (182)

  1. Nearly-uniform degree distributions in spanning subgraphs math.CO · 2026 · author #3
  2. On the Probability a Weighted Bernoulli Sum Exceeds Its Mean math.PR · 2026 · author #2
  3. The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes math.CO · 2026 · author #4
  4. Gaussian random graphs and Ramsey numbers math.CO · 2025 · author #3
  5. Completion and deficiency problems math.CO · 2019 · author #2
  6. Proof of the Brown-Erd\H{o}s-S\'os conjecture in groups math.CO · 2019 · author #2
  7. Independent arithmetic progressions math.CO · 2019 · author #3
  8. Dense induced bipartite subgraphs in triangle-free graphs math.CO · 2018 · author #3
  9. On Kahn's basis conjecture math.CO · 2018 · author #4
  10. Long monotone trails in random edge-labelings of random graphs math.CO · 2018 · author #3
  11. Anticoncentration for subgraph statistics math.CO · 2018 · author #2
  12. Ramsey goodness of cycles math.CO · 2018 · author #2
  13. Decompositions into spanning rainbow structures math.CO · 2018 · author #3
  14. Number of 1-factorizations of regular high-degree graphs math.CO · 2018 · author #3
  15. Colouring set families without monochromatic k-chains math.CO · 2018 · author #3
  16. Hypergraph cuts above the average math.CO · 2018 · author #4
  17. Embedding rainbow trees with applications to graph labelling and decomposition math.CO · 2018 · author #3
  18. Minimum saturated families of sets math.CO · 2018 · author #3
  19. An algebraic perspective on integer sparse recovery math.NA · 2018 · author #3
  20. Monochromatic cycle covers in random graphs math.CO · 2017 · author #5
  21. The oriented size Ramsey number of directed paths math.CO · 2017 · author #2
  22. Long directed rainbow cycles and rainbow spanning trees math.CO · 2017 · author #3
  23. A counterexample to Stein's Equi-n-square Conjecture math.CO · 2017 · author #2
  24. Counting Hamilton cycles in sparse random directed graphs math.CO · 2017 · author #3
  25. Directed Ramsey number for trees math.CO · 2017 · author #3
  26. The random k-matching-free process math.CO · 2017 · author #4
  27. Submodular Minimization Under Congruency Constraints cs.DS · 2017 · author #2
  28. A remark on Hamilton cycles with few colors math.CO · 2017 · author #3
  29. Zero forcing number of graphs math.CO · 2017 · author #3
  30. Tower-type bounds for unavoidable patterns in words math.CO · 2017 · author #3
  31. Monochromatic paths in random tournaments math.CO · 2017 · author #3
  32. Non-trivially intersecting multi-part families math.CO · 2017 · author #2
  33. Linearly many rainbow trees in properly edge-coloured complete graphs math.CO · 2017 · author #2
  34. Equiangular subspaces in Euclidean spaces math.CO · 2017 · author #2
  35. Ramsey goodness of bounded degree trees math.CO · 2016 · author #3
  36. Hereditary quasirandomness without regularity math.CO · 2016 · author #3
  37. Two remarks on even and oddtown problems math.CO · 2016 · author #1
  38. Supersaturation in Posets and Applications Involving the Container Method math.CO · 2016 · author #3
  39. Robustness of graph properties math.CO · 2016 · author #1
  40. Counting Hamilton decompositions of oriented graphs math.CO · 2016 · author #3
  41. Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles math.CO · 2016 · author #3
  42. Packing Hamilton Cycles Online math.CO · 2016 · author #5
  43. Intercalates and Discrepancy in Random Latin Squares math.CO · 2016 · author #2
  44. Anagram-free colorings of graphs math.CO · 2016 · author #3
  45. The extremal function for cycles of length $\ell$ mod $k$ math.CO · 2016 · author #1
  46. Equiangular Lines and Spherical Codes in Euclidean Space math.CO · 2016 · author #4
  47. Testing Equality in Communication Graphs math.CO · 2016 · author #3
  48. Bounds for spherical codes math.CO · 2016 · author #2
  49. Domination in 3-tournaments math.CO · 2016 · author #2
  50. Bounded colorings of multipartite graphs and hypergraphs math.CO · 2016 · author #2
  51. Ramsey goodness of paths math.CO · 2015 · author #2
  52. On graphs decomposable into induced matchings of linear sizes math.CO · 2015 · author #3
  53. The number of Hamiltonian decompositions of regular graphs math.CO · 2015 · author #3
  54. Saturation in random graphs math.CO · 2015 · author #2
  55. The number of additive triples in subsets of abelian groups math.CO · 2015 · author #2
  56. Short proofs of some extremal results II math.CO · 2015 · author #3
  57. On the maximum quartet distance between phylogenetic trees cs.DM · 2015 · author #3
  58. Finding paths in sparse random graphs requires many queries math.CO · 2015 · author #3
  59. Finding Hamilton cycles in random graphs with few queries math.CO · 2015 · author #3
  60. Properly colored and rainbow copies of graphs with few cherries math.CO · 2015 · author #1
  61. A random triadic process math.CO · 2015 · author #3
  62. Cycles and matchings in randomly perturbed digraphs and hypergraphs math.CO · 2015 · author #3
  63. Recent developments in graph Ramsey theory math.CO · 2015 · author #3
  64. Some Remarks on Rainbow Connectivity math.CO · 2015 · author #3
  65. Comparable pairs in families of sets math.CO · 2014 · author #4
  66. Ordered Ramsey numbers math.CO · 2014 · author #4
  67. Compatible Hamilton cycles in random graphs math.CO · 2014 · author #3
  68. Compatible Hamilton cycles in Dirac graphs math.CO · 2014 · author #3
  69. The threshold probability for long cycles math.CO · 2014 · author #3
  70. Almost-Fisher families math.CO · 2014 · author #2
  71. Counting and packing Hamilton $\ell$-cycles in dense hypergraphs math.CO · 2014 · author #3
  72. On the number of monotone sequences math.CO · 2014 · author #2
  73. On the grid Ramsey problem and related questions math.CO · 2014 · author #4
  74. Random directed graphs are robustly Hamiltonian math.CO · 2014 · author #3
  75. Cycles in triangle-free graphs of large chromatic number math.CO · 2014 · author #2
  76. Decomposing random graphs into few cycles and edges math.CO · 2014 · author #3
  77. The Erd\H{o}s-Gy\'arf\'as problem on generalized Ramsey numbers math.CO · 2014 · author #4
  78. $K_{s,t}$-saturated bipartite graphs math.CO · 2014 · author #3
  79. Large subgraphs without complete bipartite graphs math.CO · 2014 · author #3
  80. Most Probably Intersecting Hypergraphs math.CO · 2013 · author #2
  81. Maximizing the number of independent sets of a fixed size math.CO · 2013 · author #3
  82. Cycle packing math.CO · 2013 · author #3
  83. The minimum number of nonnegative edges in hypergraphs math.CO · 2013 · author #2
  84. The minimum number of disjoint pairs in set systems and related problems math.CO · 2013 · author #3
  85. Judicious partitions of directed graphs math.CO · 2013 · author #3
  86. A construction of almost Steiner systems math.CO · 2013 · author #4
  87. Cores of random graphs are born Hamiltonian math.CO · 2013 · author #3
  88. Sperner's Theorem and a Problem of Erdos-Katona-Kleitman math.CO · 2013 · author #3
  89. Discrepancy of random graphs and hypergraphs math.CO · 2013 · author #3
  90. Ramsey-type results for semi-algebraic relations math.CO · 2013 · author #4
  91. Counting and packing Hamilton cycles in dense graphs and oriented graphs math.CO · 2012 · author #3
  92. Short proofs of some extremal results math.CO · 2012 · author #3
  93. On the densities of cliques and independent sets in graphs math.CO · 2012 · author #5
  94. On the 3-local profiles of graphs math.CO · 2012 · author #5
  95. How many colors guarantee a rainbow matching? math.CO · 2012 · author #2
  96. Turan numbers for bipartite graphs plus an odd cycle math.CO · 2012 · author #3
  97. Sidorenko's conjecture for a class of graphs: an exposition math.CO · 2012 · author #3
  98. Small Complete Minors Above the Extremal Edge Density math.CO · 2012 · author #2
  99. Ramsey numbers of cubes versus cliques math.CO · 2012 · author #4
  100. Musical chairs math.CO · 2012 · author #6
  101. Long paths and cycles in random subgraphs of graphs with large minimum degree math.CO · 2012 · author #3
  102. A problem of Erd\H{o}s on the minimum number of $k$-cliques math.CO · 2012 · author #5
  103. Rainbow Tur\'an Problem for Even Cycles math.CO · 2012 · author #3
  104. Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs math.CO · 2012 · author #4
  105. The phase transition in random graphs - a simple proof math.CO · 2012 · author #2
  106. Robust Hamiltonicity of Dirac graphs math.CO · 2012 · author #3
  107. Self-similarity of graphs math.CO · 2012 · author #3
  108. Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications math.CO · 2011 · author #3
  109. Bisections of graphs math.CO · 2011 · author #3
  110. Dirac's theorem for random graphs math.CO · 2011 · author #2
  111. The size of a hypergraph and its matching number math.CO · 2011 · author #3
  112. On a conjecture of Erdos and Simonovits: Even Cycles math.CO · 2011 · author #2
  113. Chromatic number, clique subdivisions, and the conjectures of Haj\'os and Erd\H{o}s-Fajtlowicz math.CO · 2011 · author #3
  114. Biased orientation games math.CO · 2011 · author #3
  115. Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels math.CO · 2011 · author #6
  116. Oblivious Collaboration cs.DC · 2011 · author #6
  117. All-Pairs Shortest Paths in $O(n^2)$ time with high probability math.CO · 2011 · author #3
  118. Erdos-Szekeres-type theorems for monotone paths and convex bodies math.CO · 2011 · author #3
  119. Erdos-Hajnal-type theorems in hypergraphs math.CO · 2011 · author #3
  120. Hamiltonicity, independence number, and pancyclicity math.CO · 2011 · author #2
  121. Nonnegative k-sums, fractional covers, and probability of small deviations math.CO · 2011 · author #3
  122. Getting directed Hamilton cycle twice faster math.CO · 2011 · author #2
  123. Longest cycles in sparse random digraphs math.CO · 2011 · author #3
  124. On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs math.CO · 2011 · author #3
  125. Maximum union-free subfamilies math.CO · 2010 · author #3
  126. Cycles in Sparse Graphs II math.CO · 2010 · author #2
  127. Generating all subsets of a finite set with disjoint unions math.CO · 2010 · author #2
  128. Long cycles in subgraphs of (pseudo)random directed graphs math.CO · 2010 · author #3
  129. The size Ramsey number of a directed path math.CO · 2010 · author #3
  130. Bandwidth theorem for random graphs math.CO · 2010 · author #3
  131. An approximate version of Sidorenko's conjecture math.CO · 2010 · author #3
  132. A new bound for the cops and robbers problem math.CO · 2010 · author #2
  133. A counterexample to the Alon-Saks-Seymour conjecture and related problems math.CO · 2010 · author #2
  134. A conjecture of Erd\H{o}s on graph Ramsey numbers math.CO · 2010 · author #1
  135. On two problems in graph Ramsey theory math.CO · 2010 · author #3
  136. Local resilience and Hamiltonicity Maker-Breaker games in random-regular graphs math.CO · 2009 · author #3
  137. Spectra of lifted Ramanujan graphs math.CO · 2009 · author #2
  138. Dependent Random Choice math.CO · 2009 · author #2
  139. Ramsey games with giants math.CO · 2009 · author #5
  140. An improved bound for the stepping-up lemma math.CO · 2009 · author #3
  141. Decompositions into subgraphs of small diameter math.CO · 2009 · author #2
  142. Resilient pancyclicity of random and pseudo-random graphs math.CO · 2009 · author #3
  143. Paths and stability number in digraphs math.CO · 2009 · author #2
  144. Pancyclicity of Hamiltonian and highly connected graphs math.CO · 2009 · author #2
  145. Large almost monochromatic subsets in hypergraphs math.CO · 2009 · author #3
  146. Maximizing the number of q-colorings math.CO · 2008 · author #3
  147. Directed graphs without short cycles math.CO · 2008 · author #3
  148. Hypergraph Ramsey numbers math.CO · 2008 · author #3
  149. Regular induced subgraphs of a random graph math.CO · 2008 · author #2
  150. On the random satisfiable process math.CO · 2008 · author #2
  151. Triangle packings and 1-factors in oriented graphs math.CO · 2008 · author #2
  152. Hamiltonicity thresholds in Achlioptas processes math.CO · 2008 · author #3
  153. Unavoidable patterns math.CO · 2008 · author #2
  154. Two remarks on the Burr-Erdos conjecture math.CO · 2008 · author #2
  155. Large induced trees in K_r-free graphs math.CO · 2008 · author #3
  156. Discrete Kakeya-type problems and small bases math.CO · 2007 · author #3
  157. Ramsey-type problem for an almost monochromatic K_4 math.CO · 2007 · author #2
  158. Large nearly regular induced subgraphs math.CO · 2007 · author #3
  159. Ramsey numbers of sparse hypergraphs math.CO · 2007 · author #3
  160. Avoiding small subgraphs in Achlioptas processes math.CO · 2007 · author #3
  161. Density theorems for bipartite graphs and related Ramsey-type results math.CO · 2007 · author #2
  162. Cycle lengths in sparse graphs math.CO · 2007 · author #1
  163. Nearly optimal embeddings of trees math.CO · 2007 · author #1
  164. The game chromatic number of random graphs math.CO · 2007 · author #3
  165. How many random edges make a dense hypergraph non-2-colorable? math.CO · 2007 · author #1
  166. Additive approximation for edge-deletion problems math.CO · 2007 · author #3
  167. Minors in expanding graphs math.CO · 2007 · author #2
  168. Induced Ramsey-type theorems math.CO · 2007 · author #2
  169. Local resilience of graphs math.CO · 2007 · author #1
  170. Ramsey numbers and the size of graphs math.CO · 2007 · author #1
  171. Making a K_4-free graph bipartite math.CO · 2007 · author #1
  172. Embedding nearly-spanning bounded degree trees math.CO · 2007 · author #3
  173. On graphs with subgraphs of large independence numbers math.CO · 2007 · author #2
  174. Independent transversals in locally sparse graphs math.CO · 2007 · author #2
  175. On the strong chromatic number of random graphs math.CO · 2007 · author #2
  176. Constrained Ramsey Numbers math.CO · 2007 · author #2
  177. On a problem of Duke-Erdos-Rodl on cycle-connected subgraphs math.CO · 2007 · author #2
  178. Pseudo-random graphs math.CO · 2005 · author #2
  179. List colouring of graphs with at most $\big(2-o(1)\big)\chi$ vertices math.CO · 2003 · author #2
  180. On a hypergraph Turan problem of Frankl math.CO · 2002 · author #2
  181. On the Largest Eigenvalue of a Random Subgraph of the Hypercube math.PR · 2002 · author #2
  182. THe largest eigenvalue of sparse random graphs math.CO · 2001 · author #2

Mentions

  • 2606.30612 #3 · arxiv_oai · confidence 0.70 Benny Sudakov
  • 2606.30287 #2 · arxiv_oai · confidence 0.70 Benny Sudakov
  • 1510.09187 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1801.01526 #3 · arxiv_oai · confidence 0.70 Benny Sudakov
  • 1507.03764 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1507.00547 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1505.04344 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1505.00734 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1505.00730 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1504.06176 #1 · backfill · confidence 0.70 Benny Sudakov
  • 1503.05072 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1501.04816 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1501.02474 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1501.00821 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1411.4196 #4 · backfill · confidence 0.70 Benny Sudakov
  • 1410.5292 #4 · backfill · confidence 0.70 Benny Sudakov
  • 1410.1438 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1410.1435 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1408.4332 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1408.3496 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1406.3091 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1405.6894 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1405.6587 #4 · backfill · confidence 0.70 Benny Sudakov
  • 1404.4734 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1404.4544 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1404.3306 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1403.0250 #4 · backfill · confidence 0.70 Benny Sudakov
  • 1402.2471 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1401.6711 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1312.0840 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1311.4147 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1310.0632 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1309.2549 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1305.6715 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1305.2986 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1303.4065 #4 · backfill · confidence 0.70 Benny Sudakov
  • 1303.3524 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1302.5210 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1302.3507 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1301.0074 #4 · backfill · confidence 0.70 Benny Sudakov
  • 1212.4667 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1212.1300 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1211.4532 #5 · backfill · confidence 0.70 Benny Sudakov
  • 1211.3106 #5 · backfill · confidence 0.70 Benny Sudakov
  • 1211.0793 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1210.3805 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1209.0184 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1208.3568 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1208.1732 #4 · backfill · confidence 0.70 Benny Sudakov
  • 1208.0813 #6 · backfill · confidence 0.70 Benny Sudakov
  • 1207.0312 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1203.2723 #5 · backfill · confidence 0.70 Benny Sudakov
  • 1202.3221 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1202.2602 #4 · backfill · confidence 0.70 Benny Sudakov
  • 1201.6529 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1201.2202 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1201.0924 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1111.0253 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1109.3180 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1108.2502 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1107.5544 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1107.4715 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1107.1920 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1107.1844 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1107.1219 #6 · backfill · confidence 0.70 Benny Sudakov
  • 1106.2065 #6 · backfill · confidence 0.70 Benny Sudakov
  • 1105.3770 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1105.2097 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1104.5544 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1104.3334 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1104.1753 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1103.5522 #2 · backfill · confidence 0.70 Benny Sudakov
  • 2512.17718 #3 · arxiv_oai · confidence 0.70 Benny Sudakov
  • 1102.3147 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1101.3099 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1012.3127 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1010.5309 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1010.4877 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1009.3721 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1005.5171 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1005.1947 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1004.4236 #3 · backfill · confidence 0.70 Benny Sudakov
  • 1004.2010 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1002.4687 #2 · backfill · confidence 0.70 Benny Sudakov
  • 1002.0095 #1 · backfill · confidence 0.70 Benny Sudakov
  • 1002.0045 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0911.4351 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0911.4148 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0909.3271 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0907.5590 #5 · backfill · confidence 0.70 Benny Sudakov
  • 0907.0283 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0906.3530 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0906.1397 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0905.2644 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0903.4567 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0901.3912 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0811.2625 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0809.4690 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0808.3760 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0808.2023 #2 · backfill · confidence 0.70 Benny Sudakov

Frequent Coauthors