English

New results relating independence and matchings

Combinatorics 2019-09-20 v1

Abstract

In this paper we study relationships between the \emph{matching number}, written μ(G)\mu(G), and the \emph{independence number}, written α(G)\alpha(G). Our first main result is to show α(G)μ(G)+Xμ(G[NG[X]]), \alpha(G) \le \mu(G) + |X| - \mu(G[N_G[X]]), where XX is \emph{any} intersection of maximum independent sets in GG. Our second main result is to show δ(G)α(G)Δ(G)μ(G), \delta(G)\alpha(G) \le \Delta(G)\mu(G), where δ(G)\delta(G) and Δ(G)\Delta(G) denote the minimum and maximum vertex degrees of GG, respectively. These results improve on and generalize known relations between μ(G)\mu(G) and α(G)\alpha(G). Further, we also give examples showing these improvements.

Cite

@article{arxiv.1909.09093,
  title  = {New results relating independence and matchings},
  author = {Yair Caro and Randy Davila and Ryan Pepper},
  journal= {arXiv preprint arXiv:1909.09093},
  year   = {2019}
}
R2 v1 2026-06-23T11:20:27.911Z