◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

David M. Howard

7 papers hereh-index 9266 citations20 works total

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

author position
  • first author2
  • middle author2
  • last author3

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

fields
  • math.CO7

identity via Semantic Scholar / OpenAlex

activity
20112017
most citedDimension of posets with planar cover graphs excluding two long incomparable chains

9 citations · 14 across the 5 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

math.CO2016

Large rainbow matchings in general graphs

Ron Aharoni, Eli Berger, Maria Chudnovsky +2

By a theorem of Drisko, any 2n−1 matchings of size n in a bipartite graph have a partial rainbow matching of size n. Inspired by discussion of Barát, Gyárfás and Sárközy, we…

math.CO2016★ 9 cited

Dimension of posets with planar cover graphs excluding two long incomparable chains

David M. Howard, Noah Streib, William T. Trotter +2

It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must h…

math.CO2016

A rainbow r-partite version of the Erdős-Ko-Rado theorem

Ron Aharoni, David Howard

Let f(n,r,k) be the minimal number such that every hypergraph larger than f(n,r,k) contained in (r[n]​) contains a matching of size k, and let g(n,r,k) be the mini…

math.CO2016

Cross-intersecting pairs of hypergraphs

Ron Aharoni, David Howard

Two hypergraphs H1​, H2​ are called {\em cross-intersecting} if e1​∩e2​=∅ for every pair of edges e1​∈H1​, e2​∈H2​. Each of the hypergraphs is then…

◍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.