2 papers
math.CO2016
Degree conditions for matchability in -partite hypergraphs
Ron Aharoni, Eli Berger, Dani Kotlar +1
We study conjectures relating degree conditions in -partite hypergraphs to the matching number of the hypergraph, and use topological methods to prove special cases. In particul…
math.CO2016
On a conjecture of Stein
Ron Aharoni, Eli Berger, Dani Kotlar +1
Stein proposed the following conjecture: if the edge set of is partitioned into sets, each of size , then there is a partial rainbow matching of size . He pro…