Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs
classification
🧮 math.CO
keywords
matchingsfullrainbowcontainsgraphshypergraphsmatchingaharoni
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.