7.5k citations
- E. Levin2 profiles18 · h 52
- N. Alon14 · h 106
- Boris A. Malomed12
- J. Klafter2 profiles12 · h 79
- A. Nitzan11 · h 75
- L. Frankfurt3 profiles11 · h 46
- Michael Galperin2 profiles11 · h 38
- M. Strikman3 profiles11 · h 54
- A. Mutter2 profiles10 · h 29
- B. Malomed10 · h 84
- Michael Krivelevich2 profiles10 · h 53
- T. Schörner-Sadenius3 profiles9 · h 31
- Weizmann Institute of ScienceIL32 papers
- Massachusetts Institute of TechnologyUS21 papers
- European Organization for Nuclear ResearchCH17 papers
- Pennsylvania State UniversityUS17 papers
- Princeton UniversityUS17 papers
- University of FreiburgDE17 papers
- University of BonnDE14 papers
- CEA Paris-SaclayFR13 papers
- Heidelberg UniversityDE13 papers
- Technion – Israel Institute of TechnologyIL13 papers
- University of California, BerkeleyUS13 papers
- University of ChicagoUS13 papers
6 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…
Message passing for the coloring problem: Gallager meets Alon and Kahale
Sonny Ben-Shimon, Dan Vilenchik
Message passing algorithms are popular in many combinatorial optimization problems. For example, experimental results show that {\em survey propagation} (a certain message passing…
Vertex Percolation on Expander Graphs
Sonny Ben-Shimon, Michael Krivelevich
We say that a graph on vertices is a -expander for some constant if every of cardinality satisfies w…
Minors in expanding graphs
Michael Krivelevich, Benny Sudakov
Extending several previous results we obtained nearly tight estimates on the maximum size of a clique-minor in various classes of expanding graphs. These results can be used to sho…
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…