Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs
Combinatorics
2017-10-16 v1
Abstract
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 several conjectures on matchings in hypergraphs and full rainbow matchings in graphs, made by Aharoni and Berger and others.
Cite
@article{arxiv.1710.04807,
title = {Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs},
author = {Pu Gao and Reshma Ramadurai and Ian M. Wanless and Nick Wormald},
journal= {arXiv preprint arXiv:1710.04807},
year = {2017}
}