New results relating independence and matchings
Combinatorics
2019-09-20 v1
Abstract
In this paper we study relationships between the \emph{matching number}, written , and the \emph{independence number}, written . Our first main result is to show where is \emph{any} intersection of maximum independent sets in . Our second main result is to show where and denote the minimum and maximum vertex degrees of , respectively. These results improve on and generalize known relations between and . 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}
}