A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
A connected matching in a graph G is a matching contained in a connected component of G. A well-known method due to Łuczak reduces problems about monochromatic paths and cycles in complete graphs to problems about monochromatic connected matchings in almost complete graphs. We show that these can be further reduced to problems about monochromatic connected matchings in complete graphs. We illustrate the potential of this new reduction by showing how it can be used to determine the 3-colourarXiv:2009.03119v4 fatcat:iesjvearevcapn6hg7ohkdiy5m