164 research outputs found
Rainbow matchings in bipartite multigraphs
Suppose that is a non-negative integer and a bipartite multigraph is
the union of matchings
, each of size . We show that has a rainbow matching of
size , i.e. a matching of size with all edges coming from different
's. Several choices of parameters relate to known results and conjectures
Minimum degree conditions for monochromatic cycle partitioning
A classical result of Erd\H{o}s, Gy\'arf\'as and Pyber states that any
-edge-coloured complete graph has a partition into
monochromatic cycles. Here we determine the minimum degree threshold for this
property. More precisely, we show that there exists a constant such that
any -edge-coloured graph on vertices with minimum degree at least has a partition into monochromatic cycles. We also
provide constructions showing that the minimum degree condition and the number
of cycles are essentially tight.Comment: 22 pages (26 including appendix
- …