119 citations
- University of California, Los AngelesUS8 papers
- Berkeley CollegeUS3 papers
- Cornell UniversityUS3 papers
- European Organization for Nuclear ResearchCH3 papers
- Universidad Braulio CarrilloCR3 papers
- University of British ColumbiaCA3 papers
- University of California, BerkeleyUS3 papers
- California Institute of TechnologyUS2 papers
- CEA Paris-SaclayFR2 papers
- Charles UniversityCZ2 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR2 papers
- Fermi National Accelerator LaboratoryUS2 papers
Showing math.COShow all
2 papers · 1 filter
math.CO2007
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…
math.CO2007★ 2 cited
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…