Skip to main content
SpringerLink
Log in

An ore-type condition for the existence ofk-factors in graphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Letk be a positive integer, and letG be a graph of ordern withn ≧ 4k − 5,kn even and minimum degree at leastk. We prove that if the degree sum of each pair of nonadjacent vertices is at leastn, thenG has ak-factor.

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

Access this article

Log in via an institution

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. Chartrand G., Lesniak L.: Graphs & Digraphs, Wadsworth, Monterey, California, (1986)

  2. Egawa Y., Enomoto H.: Sufficient conditions for the existence ofk-factors, Recent Studies in Graph Theory, Ed.: V. Kulli, Vishwa, Gulbarga (1989) 96–105

    Google Scholar 

  3. Iida T.: A neighborhood condition for the existence ofk-factors, Master Thesis, Dept. of Math., Tokai Univ. (1990)

  4. Kano M. and Tokushige N.: Binding numbers andf-factors of graphs. J. Comb. Theory B. (to appear)

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

    Google Scholar 

  6. Katerinis P. and Woodall D.R.: Binding numbers of graphs and the existence ofk-factors. Quart. J. Math.38, 221–228 (1987)

    Google Scholar 

  7. Nishimura T.: Independence number, connectivity andr-factors, J. Graph Theory13, 63–69 (1989)

    Google Scholar 

  8. Ore O.: Note on hamilton circuits, Amer. Math. Monthly67, 55 (1960)

    Google Scholar 

  9. Tutte W.T.: The factors of graphs, Can. J. Math.4, 314–328, (1952)

    Google Scholar 

Download references

Author information

Author notes

  1. Tsuyoshi Nishimura

    Present address: Department of Mathematics, Akashi College of Technology, 674, Vozumi, Akashi, Japan

Authors and Affiliations

  1. Department of Mathematics, Tokai University, 259-12, Hiratsuka, Kanagawa, Japan

    Tadashi Iida

  2. Department of Applied Mathematics, Science University of Tokyo, Shinjuku-ku, 162, Tokyo, Japan

    Tsuyoshi Nishimura

Authors
  1. Tadashi Iida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tsuyoshi Nishimura
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iida, T., Nishimura, T. An ore-type condition for the existence ofk-factors in graphs. Graphs and Combinatorics 7, 353–361 (1991). https://doi.org/10.1007/BF01787640

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation