collaborators

1 paper

math.CO2017

Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs

Pu Gao, Reshma Ramadurai, Ian M. Wanless +1

A graph whose edges are coloured (not necessarily properly) contains a full rainbow matching if there is a matching that contains exactly one edge of each colour. We refute…