Abstract
LetG be a bipartite graph with bipartition (X, Y) andk a positive integer. If
\(\left| X \right| \geqslant 4k - 4\sqrt k + 1\) when |X| is odd and |X| ≥ 4k − 2 when |X| is even, thenG has ak-factor.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Amstrerdam: North Holland 1976
Katerinis, P.: Minimum degree of a graph and the existence ofk-factors. Proc. Indian Acad. Sci.,94 (Nos 2 and 3), 123–127 (1985)
Ore, O.: Theory of Graphs. American Mathematics Society College Publishers 1962
Author information
Authors and Affiliations
Additional information
This work is dedicated to Astero.
Rights and permissions
About this article
Cite this article
Katerinis, P. Minimum degree of bipartite graphs and the existence ofk-factors. Graphs and Combinatorics 6, 253–258 (1990). https://doi.org/10.1007/BF01787577
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01787577