Spectral radius and rainbow matchings of graphs

Abstract: Let

n, m

be integers such that

1 l e q m l e q (n - 2) / 2

and let

[n] = 1, l d o t s, n

. Let

m a t h c a l G = G_{1}, l d o t s, G_{m + 1}

be a family of graphs on the same vertex set

[n]

. In this paper, we prove that if for any

i i n [m + 1]

, the spectral radius of

G_{i}

is not less than

m a x 2 m, f r a c 12 (m - 1 + s q r t (m - 1)^{2} + 4 m (n - m))

, then

m a t h c a l G

admits a rainbow matching, i.e. a choice of disjoint edges

e_{i} i n G_{i}

, unless

G_{1} = G_{2} = l d o t s = G_{m + 1}

and

G_{1} i n K_{2 m + 1} c u p (n - 2 m - 1) K_{1}, K_{m} v e e (n - m) K_{1}

.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Spectral radius and rainbow matchings of graphs