3,510 research outputs found

    Large rainbow matchings in large graphs

    Full text link
    A \textit{rainbow subgraph} of an edge-colored graph is a subgraph whose edges have distinct colors. The \textit{color degree} of a vertex vv is the number of different colors on edges incident to vv. We show that if nn is large enough (namely, n≥4.25k2n\geq 4.25k^2), then each nn-vertex graph GG with minimum color degree at least kk contains a rainbow matching of size at least kk
    • …
    corecore