Skip to main content
Log in

Minimum degree of bipartite graphs and the existence ofk-factors

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

LetG be a bipartite graph with bipartition (X, Y) andk a positive integer. If

$$\left| X \right| = \left| Y \right|,$$
((i))
$$\delta (G) \geqslant \left\lceil {\frac{{\left| X \right|}}{2}} \right\rceil \geqslant k,$$
((ii))

\(\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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Amstrerdam: North Holland 1976

    Google Scholar 

  2. Katerinis, P.: Minimum degree of a graph and the existence ofk-factors. Proc. Indian Acad. Sci.,94 (Nos 2 and 3), 123–127 (1985)

    Google Scholar 

  3. Ore, O.: Theory of Graphs. American Mathematics Society College Publishers 1962

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work is dedicated to Astero.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01787577

Keywords

Navigation