Maximal matchings in graphs with large neighborhoods of independent vertices
暂无分享,去创建一个
We obtain lower bounds on the size of a maximum matching in a graph satisfying the condition |N(X)| ≥ s for every independent set X of m vertices, thus generalizing results of Faudree, Gould, Jacobson, and Schelp for the case m = 2.
[1] W. T. Tutte. The Factorization of Linear Graphs , 1947 .
[2] Richard H. Schelp,et al. Extremal problems involving neighborhood unions , 1987, J. Graph Theory.