On lower bounds for the matching number of subcubic graphs
Abstract
We give a complete description of the set of triples (a,b,c) of real numbers with the following property. There exists a constant K such that a n3 + b n2 + c n1 - K is a lower bound for the matching number of every connected subcubic graph G, where ni denotes the number of vertices of degree i for each i.
0
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.