New results relating independence and matchings
Abstract
In this paper we study relationships between the matching number, written μ(G), and the independence number, written α(G). Our first main result is to show \[ α(G) μ(G) + |X| - μ(G[NG[X]]), \] where X is any intersection of maximum independent sets in G. Our second main result is to show \[ δ(G)α(G) (G)μ(G), \] where δ(G) and (G) denote the minimum and maximum vertex degrees of G, respectively. These results improve on and generalize known relations between μ(G) and α(G). Further, we also give examples showing these improvements.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.