Abstract
Let k, h be positive integers with k ≤ h. A graph G is called a [k, h]-graph if k ≤ d(v) ≤ h for any \({v \in V(G)}\). Let G be a [k, h]-graph of order 2n such that k ≥ n. Hilton (J. Graph Theory 9:193–196, 1985) proved that G contains at least \({\lfloor k/3\rfloor}\) disjoint perfect matchings if h = k. Hilton’s result had been improved by Zhang and Zhu (J. Combin. Theory, Series B, 56:74–89, 1992), they proved that G contains at least \({\lfloor k/2\rfloor}\) disjoint perfect matchings if k = h. In this paper, we improve Hilton’s result from another direction, we prove that Hilton’s result is true for [k, k + 1]-graphs. Specifically, we prove that G contains at least \({\lfloor\frac{n}3\rfloor+1+(k-n)}\) disjoint perfect matchings if h = k + 1.
Similar content being viewed by others
References
Bondy J.A., Murty U.S.R.: Graph theory with applications. North-Holland, New York (1976)
Dirac G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. 2, 69–81 (1952)
Hilton A.J.W.: Factorizations of regular graphs of high degree. J. Graph Theory 9, 193–196 (1985)
Katerinis P.: Maximum matchings in a regular graph of specified connectivity and bounded order. J. Graph Theory 11, 53–58 (1987)
Petersen J.: Die theorie der regulären graphen. Acta Math. 15, 163–220 (1891)
Tutte W.T.: The factorization of linear graphs. J. London Math. Soc. 22, 107–111 (1947)
Zhang C.Q., Zhu Y.J.: Factorizations of regular graphs. J. Combin. Theory, Series B 56, 74–89 (1992)
Author information
Authors and Affiliations
Corresponding author
Additional information
The work was supported by NNSF of China (No.10701068 and 11071233).
Rights and permissions
About this article
Cite this article
Hou, X. On the Perfect Matchings of Near Regular Graphs. Graphs and Combinatorics 27, 865–869 (2011). https://doi.org/10.1007/s00373-010-1008-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-010-1008-8