◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Daniel J. Harvey

10 papers hereh-index 11425 citations33 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author8
  • middle author2

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • math.CO10

identity via Semantic Scholar / OpenAlex

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 2012 · math.COShow all

2 papers · 2 filters

math.CO2012★ 1 cited

Treewidth of the Line Graph of Complete and Complete Multipartite Graphs

Daniel J. Harvey, David R. Wood

In recent papers by Grohe and Marx, the treewidth of the line graph of the complete graph is a critical example. We determine the exact treewidth of the line graph of the complete…

math.CO2012★ 4 cited

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

Vida Dujmović, Daniel J. Harvey, Gwenaël Joret +2

Let g(t) be the minimum number such that every graph G with average degree d(G) \geq g(t) contains a K_{t}-minor. Such a function is known to exist, as originally shown by Mader. K…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.