WorksMathematics
Rainbow Matchings in -free Graphs
Abstract
Let be positive integers with , where is sufficiently large relative to . Alon and Frankl determined the maximum number of edges in an -vertex graph containing neither nor a matching of size . In this paper, we establish a rainbow analogue of their result. More precisely, if are -free graphs on a common vertex set of size , each having more than edges, then admits a rainbow matching.