4 citations · 4 across the 5 of their papers we have counts for
1 paper · 2 filters
Pu Gao, Reshma Ramadurai, Ian M. Wanless +1
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…