Abstract
AbstractRainbow matchings in graphs and in hypergraphs have been studied extensively, one motivation coming from questions on matchings in 3‐partite hypergraphs, including questions on transversals in Latin squares. Matchings in graphs are independent sets in line graphs, so a natural problem is to extend the study to rainbow independent sets in general graphs. We study problems of the following form: given a class of graphs, how many independent sets of size in a graph belonging to are needed to guarantee the existence of a rainbow set of size ? A particularly interesting case is the class of graphs having a given upper bound on their maximum degree.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
