20 citations · 77 across the 24 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 1 cited
On a Ramsey-type problem of Erdős and Pach
Ross J. Kang, Eoin Long, Viresh Patel +1
In this paper we show that there exists a constant such that for any graph on vertices either or its complement has an induced subgraph on ver…
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…