1 research outputs found
Maximum matchings in regular graphs
It was conjectured by Mkrtchyan, Petrosyan, and Vardanyan that every graph
with has a maximum matching such that any
two -unsaturated vertices do not share a neighbor. In this note, we confirm
the conjecture for all -regular simple graphs and also -regular
multigraphs with .Comment: Fixed some incomplete arguments in the previous versio