  A graph $G$ whose edges are coloured (not necessarily properly) contains a
full rainbow matching if there is a matching $M$ 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.
