pith. machine review for the scientific record. sign in

Benny Sudakov

Identifiers

  • name variant Benny Sudakov 0.60 · backfill

Papers (179)

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

Mentions

  • 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
  • 0807.4326 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0806.2027 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0804.4707 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0803.2375 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0803.1860 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0803.1637 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0711.1604 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0710.5571 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0710.2106 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0710.0027 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0708.0443 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0707.4159 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0707.2117 #1 · backfill · confidence 0.70 Benny Sudakov
  • 0707.2079 #1 · backfill · confidence 0.70 Benny Sudakov
  • 0707.0465 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0707.0315 #1 · backfill · confidence 0.70 Benny Sudakov
  • 0707.0134 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0707.0133 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0706.4112 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0706.4104 #1 · backfill · confidence 0.70 Benny Sudakov
  • 0706.4102 #1 · backfill · confidence 0.70 Benny Sudakov
  • 0706.4101 #1 · backfill · confidence 0.70 Benny Sudakov
  • 0706.4100 #3 · backfill · confidence 0.70 Benny Sudakov
  • 0706.4099 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0706.2124 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0706.2110 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0706.2107 #2 · backfill · confidence 0.70 Benny Sudakov
  • 0706.1920 #2 · backfill · confidence 0.70 Benny Sudakov

Frequent Coauthors