Rainbow 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 (Figure presented.) of graphs, how many independent sets of size (Figure presented.) in a graph belonging to (Figure presented.) are needed to guarantee the existence of a rainbow set of size (Figure presented.) ? A particularly interesting case is the class of graphs having a given upper bound on their maximum degree.
CITATION STYLE
Aharoni, R., Briggs, J., Kim, J., & Kim, M. (2023). Rainbow independent sets in certain classes of graphs. Journal of Graph Theory, 104(3), 557–584. https://doi.org/10.1002/jgt.22989
Mendeley helps you to discover research relevant for your work.