Yang, Zixuan: Rainbow matchings in edge-colored graphs

A subgraph is called rainbow if all its edges have distinct colors. For two graphs $G$ and $H$, the rainbow number $rb(G, H) $ is the minimum number of colors $r$ such that for every
edge-coloring of $G$ using $r$ colors, $G$ contains a rainbow $H$. In this talk, we consider the existence of rainbow matchings in general edge-colored graphs under the condition of  the sum of the number of edges and colors, which implies the known result of rainbow number of matchings (Chen, Li, and Tu, 2008). These are joint works with Binlong Li, Yang Meng, and Feihong Yuan.

Zoom: https://us06web.zoom.us/j/87942357806?pwd=DObDjZ10qaD4guIVPhsO5QAJHqEVa2.1
Meeting ID: 879 4235 7806
Passcode: 279288