Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.