9 citations · 13 across the 4 of their papers we have counts for
7 papers
The Width of Downsets
Dwight Duffus, David Howard, Imre Leader
How large an antichain can we find inside a given downset in the lattice of subsets of [n]? Sperner's theorem asserts that the largest antichain in the whole lattice has size the b…
Large rainbow matchings in general graphs
Ron Aharoni, Eli Berger, Maria Chudnovsky +2
By a theorem of Drisko, any matchings of size in a bipartite graph have a partial rainbow matching of size . Inspired by discussion of Barát, Gyárfás and Sárközy, we…
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…
A rainbow -partite version of the Erdős-Ko-Rado theorem
Ron Aharoni, David Howard
Let be the minimal number such that every hypergraph larger than contained in contains a matching of size , and let be the mini…
Cross-intersecting pairs of hypergraphs
Ron Aharoni, David Howard
Two hypergraphs are called {\em cross-intersecting} if for every pair of edges . Each of the hypergraphs is then…
On a Generalization of the Ryser-Brualdi-Stein Conjecture
Ron Aharoni, Pierre Charbit, David Howard
A rainbow matching for (not necessarily distinct) sets F_1,...,F_k of hypergraph edges is a matching consisting of k edges, one from each F_i. The aim of the paper is twofold - to…