On the number of 1-factors of locally finite graphs☆

https://doi.org/10.1016/0095-8956(83)90005-9Get rights and content
Under an Elsevier user license
open archive

Abstract

Every infinite locally finite graph with exactly one 1-factor is at most 2-connected is shown. More generally a lower bound for the number of 1-factors in locally finite n-connected graphs is given.

Cited by (0)

☆

This research was supported by a grant of the D.G.R.S.T., Contract 79317.

Copyright © 1983 Published by Elsevier Inc.