29.3k citations
- D. Schaile9 profiles92 · h 87
- M. Strauss11 profiles86 · h 130
- K. M. Chan2 profiles80
- A. Meyer3 profiles78 · h 142
- B. Åsman9 profiles78 · h 98
- C. Bélanger-Champagne2 profiles78 · h 92
- S. Strandberg3 profiles78 · h 88
- A. Quadt10 profiles77 · h 86
- A. Sopczak2 profiles77 · h 83
- G. Borissov3 profiles77 · h 100
- H. Fox4 profiles77 · h 84
- P. Lebrun12 profiles77 · h 54
- University of California, BerkeleyUS115 papers
- Columbia UniversityUS105 papers
- University of WashingtonUS105 papers
- Fermi National Accelerator LaboratoryUS101 papers
- University of ArizonaUS98 papers
- University of Maryland, College ParkUS98 papers
- University of MichiganUS90 papers
- University of Notre DameUS87 papers
- Ludwig-Maximilians-Universität MünchenDE86 papers
- Brown UniversityUS85 papers
- Tata Institute of Fundamental ResearchIN85 papers
- University of Science and Technology of ChinaCN85 papers
9 papers · 2 filters
Discrete Kakeya-type problems and small bases
Noga Alon, Boris Bukh, Benny Sudakov
A subset U of a group G is called k-universal if U contains a translate of every k-element subset of G. We give several nearly optimal constructions of small k-universal sets, and…
Harmonic morphisms and hyperelliptic graphs
Matthew Baker, Serguei Norine
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-…
Density theorems for bipartite graphs and related Ramsey-type results
Jacob Fox, Benny Sudakov
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new boun…
Ramsey numbers and the size of graphs
Benny Sudakov
For two graph H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every red-blue edge coloring of the complete graph K_n on n vertices contains either a…
Embedding nearly-spanning bounded degree trees
Noga Alon, Michael Krivelevich, Benny Sudakov
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-ε)n vertices, in terms of the expansion properti…
On graphs with subgraphs of large independence numbers
Noga Alon, Benny Sudakov
Let G be a graph on n vertices in which every induced subgraph on s=\log^3 n vertices has an independent set of size at least t=\log n. What is the largest q=q(n) so that every suc…