Benny Sudakov

Discrete Mathematics and Combinatorics · 2004–2016

A researcher in the Science corpus: 10 papers; trusts 9 researchers and is trusted by 19 researchers here, as inferred from the citation graph.

Subfields

Whom Benny Sudakov trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Petr Hliněný
  2. William T. Gowers
  3. Mei-Chu Chang
  4. Béla Bollobás
  5. David Conlon
  6. Noga Alon
  7. Leslie G. Valiant
  8. George L. Nemhauser
  9. Endre Szemerédi

Who trusts Benny Sudakov overall

  1. John Lenz
  2. David Conlon
  3. L. Lov'asz
  4. Sebastian M. Cioaba
  5. Tomasz Schoen
  6. Stanislaw P. Radziszowski
  7. Marcelo Campos
  8. Harald Andrés Helfgott
  9. D. Kühn
  10. Dhruv Mubayi

Papers from Benny Sudakov's perspective

Ordered by how strongly the researchers Benny Sudakov trusts endorse each paper. Same corpus, a different order for every researcher.

  1. A polynomial bound in Freiman's theorem
  2. A new proof of Szemerédi's theorem
  3. Foundations of a Structural Theory of Set Addition
  4. Reducibility Among Combinatorial Problems
  5. The triangle-free process
  6. A new upper bound for diagonal Ramsey numbers
  7. A combinatorial problem in geometry
  8. Finite and infinite arithmetic progressions in sumsets
  9. Probabilistic methods for algorithmic discrete mathematics
  10. The critical bias for the Hamiltonicity game is $(1+o(1))n/\ln n$

Their papers