Daniel J. Harvey

activity

20152020

most citedCycles of given size in a dense graph

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

collaborators

3 papers

math.CO2020

Intersecting longest paths in chordal graphs

Daniel J. Harvey, Michael S. Payne

We consider the size of the smallest set of vertices required to intersect every longest path in a chordal graph. Such sets are known as longest path transversals. We show that if…

math.CO2018

Chromatic roots at 2 and at the Beraha number $B_{10}$

Daniel J. Harvey, Gordon F. Royle

By the construction of suitable graphs and the determination of their chromatic polynomials, we resolve two open questions concerning real chromatic roots. First we exhibit graphs…

math.CO2015★ 1 cited

Cycles of given size in a dense graph

Daniel J. Harvey, David R. Wood

We generalise a result of Corrádi and Hajnal and show that every graph with average degree at least $\frac{4}{3} k r$ contains $k$ vertex disjoint cycles, each of order at least $r$ …

Intersecting longest paths in chordal graphs

Chromatic roots at 2 and at the Beraha number B10​

Cycles of given size in a dense graph

Chromatic roots at 2 and at the Beraha number $B_{10}$