Daniel J. Harvey

activity

20122022

most citedA linear-time algorithm for finding a complete graph minor in a dense graph

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

collaborators

Showing 2013 · math.COShow all

2 papers · 2 filters

math.CO2013★ 1 cited

Parameters Tied to Treewidth

Daniel J. Harvey, David R. Wood

Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separa…

math.CO2013

Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem

Daniel J. Harvey, David R. Wood

Treewidth is an important and well-known graph parameter that measures the complexity of a graph. The Kneser graph Kneser(n,k) is the graph with vertex set $(k [ n ])$ , such t…