David G. Ferguson

most citedThe fractional chromatic number of triangle-free subcubic graphs

2 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2015★ 1 cited

The Ramsey number of mixed-parity cycles III

David G. Ferguson

Denote by $R (G_{1}, G_{2}, G_{3})$ the minimum integer $N$ such that any three-colouring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of a graph $G_{i}$ …

math.CO2015

The Ramsey number of mixed-parity cycles II

David G. Ferguson

Denote by $R (G_{1}, G_{2}, G_{3})$ the minimum integer $N$ such that any three-colouring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of a graph $G_{i}$ …

math.CO2015

The Ramsey number of mixed-parity cycles I

David G. Ferguson

Denote by $R (G_{1}, G_{2}, G_{3})$ the minimum integer $N$ such that any three-colouring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of a graph $G_{i}$ …

math.CO2012★ 2 cited

The fractional chromatic number of triangle-free subcubic graphs

David Ferguson, Tomáš Kaiser, Daniel Král'

Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14/5. Improving on estimates of Hatami and Zhu and of Lu and Peng…