A degree condition for the existence of 1-factors in graphs or their complements

Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura

Research output: Contribution to journalArticle

Abstract

We study conditions for a simple graph G or its complement Ḡ to have a 1-factor. Let G be a graph of even order n and denote by ir(G) the difference between the maximum degree and the minimum degree of G. We prove that if both G and Ḡ are connected and ir(G) ≤ [1/4n + 1], then either G or Ḡ has a 1-factor with the inequality being sharp.

Original languageEnglish
Pages (from-to)1-8
Number of pages8
JournalDiscrete Mathematics
Volume203
Issue number1-3
Publication statusPublished - 1999 May 28

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

A degree condition for the existence of 1-factors in graphs or their complements. / Ando, Kiyoshi; Kaneko, Atsushi; Nishimura, Tsuyoshi.

In: Discrete Mathematics, Vol. 203, No. 1-3, 28.05.1999, p. 1-8.

Research output: Contribution to journalArticle

@article{efc9cd0cf0d04ceaa1338fe357589950,
title = "A degree condition for the existence of 1-factors in graphs or their complements",
abstract = "We study conditions for a simple graph G or its complement Ḡ to have a 1-factor. Let G be a graph of even order n and denote by ir(G) the difference between the maximum degree and the minimum degree of G. We prove that if both G and Ḡ are connected and ir(G) ≤ [1/4n + 1], then either G or Ḡ has a 1-factor with the inequality being sharp.",
author = "Kiyoshi Ando and Atsushi Kaneko and Tsuyoshi Nishimura",
year = "1999",
month = "5",
day = "28",
language = "English",
volume = "203",
pages = "1--8",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - A degree condition for the existence of 1-factors in graphs or their complements

AU - Ando, Kiyoshi

AU - Kaneko, Atsushi

AU - Nishimura, Tsuyoshi

PY - 1999/5/28

Y1 - 1999/5/28

N2 - We study conditions for a simple graph G or its complement Ḡ to have a 1-factor. Let G be a graph of even order n and denote by ir(G) the difference between the maximum degree and the minimum degree of G. We prove that if both G and Ḡ are connected and ir(G) ≤ [1/4n + 1], then either G or Ḡ has a 1-factor with the inequality being sharp.

AB - We study conditions for a simple graph G or its complement Ḡ to have a 1-factor. Let G be a graph of even order n and denote by ir(G) the difference between the maximum degree and the minimum degree of G. We prove that if both G and Ḡ are connected and ir(G) ≤ [1/4n + 1], then either G or Ḡ has a 1-factor with the inequality being sharp.

UR - http://www.scopus.com/inward/record.url?scp=0345884754&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0345884754&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0345884754

VL - 203

SP - 1

EP - 8

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -