64 citations · 124 across the 14 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.CO2014★ 64 cited
Edge-decompositions of graphs with high minimum degree
Ben Barber, Daniela Kühn, Allan Lo +1
A fundamental theorem of Wilson states that, for every graph , every sufficiently large -divisible clique has an -decomposition. Here a graph is -divisible if $e(F)…
math.CO2014★ 1 cited
Distinguishing subgroups of the rationals by their Ramsey properties
Ben Barber, Neil Hindman, Imre Leader +1
A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system…
math.CO2014★ 7 cited
Partition regularity without the columns property
Ben Barber, Neil Hindman, Imre Leader +1
A finite or infinite matrix A with rational entries is called partition regular if whenever the natural numbers are finitely coloured there is a monochromatic vector x with Ax=0. M…