64 citations · 124 across the 14 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012★ 10 cited
Partition regularity in the rationals
Ben Barber, Neil Hindman, Imre Leader
A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solut…
math.CO2012
Random walks on quasirandom graphs
Ben Barber, Eoin Long
Let G be a quasirandom graph on n vertices, and let W be a random walk on G of length alpha n^2. Must the set of edges traversed by W form a quasirandom graph? This question was as…
math.CO2012★ 3 cited
Maximum hitting for n sufficiently large
Ben Barber
For a left-compressed intersecting family \A contained in [n]^(r) and a set X contained in [n], let \A(X) = {A in \A : A intersect X is non-empty}. Borg asked: for which X is |\A(X…