167 citations · 675 across the 52 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 7 cited
Frankl-Rödl type theorems for codes and permutations
Peter Keevash, Eoin Long
We give a new proof of the Frankl-Rödl theorem on forbidden intersections, via the probabilistic method of dependent random choice. Our method extends to codes with forbidden dista…
math.CO2014★ 167 cited
The existence of designs
Peter Keevash
We prove the existence conjecture for combinatorial designs, answering a question of Steiner from 1853. More generally, we show that the natural divisibility conditions are suffici…