A note on matchings and regu-larity of graphs

Abstract

Let  be a simple graph. We introduce the notion of comb-match , and prove that reg  comb-match +1. This improves some known bounds.