On lower bounds for the matching number of subcubic graphs
Combinatorics
2016-05-17 v2
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 n_3 + b n_2 + c n_1 - K is a lower bound for the matching number of every connected subcubic graph G, where n_i denotes the number of vertices of degree i for each i.
Keywords
Cite
@article{arxiv.1406.7227,
title = {On lower bounds for the matching number of subcubic graphs},
author = {Penny Haxell and Alex Scott},
journal= {arXiv preprint arXiv:1406.7227},
year = {2016}
}