A Degree Condition for the Existence of Regular Factors in K1, n-Free Graphs

Katsuhiro Ota, Taro Tokuda

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

A graph is called K1, n-free if it contains no K1, n as an induced subgraph. Let n(≥ 3), r be integers (if r is odd, r ≥ n - 1). We prove that every K1, n-free connected graph G with r|V(G)| even has an r-factor if its minimum degree is at least (n + n-1/r) ⌈n/2(n - 1) r⌉ - n - 1/r (⌈n/2(n - 1) r⌉)2 + n - 3. This degree condition is sharp.

Original languageEnglish
Pages (from-to)59-64
Number of pages6
JournalJournal of Graph Theory
Volume22
Issue number1
Publication statusPublished - 1996 May

Fingerprint

Degree Condition
Minimum Degree
Induced Subgraph
Connected graph
Odd
Integer
Graph in graph theory

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

A Degree Condition for the Existence of Regular Factors in K1, n-Free Graphs. / Ota, Katsuhiro; Tokuda, Taro.

In: Journal of Graph Theory, Vol. 22, No. 1, 05.1996, p. 59-64.

Research output: Contribution to journalArticle

@article{2a7d784f65d14e31b8884329b5c9ccd3,
title = "A Degree Condition for the Existence of Regular Factors in K1, n-Free Graphs",
abstract = "A graph is called K1, n-free if it contains no K1, n as an induced subgraph. Let n(≥ 3), r be integers (if r is odd, r ≥ n - 1). We prove that every K1, n-free connected graph G with r|V(G)| even has an r-factor if its minimum degree is at least (n + n-1/r) ⌈n/2(n - 1) r⌉ - n - 1/r (⌈n/2(n - 1) r⌉)2 + n - 3. This degree condition is sharp.",
author = "Katsuhiro Ota and Taro Tokuda",
year = "1996",
month = "5",
language = "English",
volume = "22",
pages = "59--64",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - A Degree Condition for the Existence of Regular Factors in K1, n-Free Graphs

AU - Ota, Katsuhiro

AU - Tokuda, Taro

PY - 1996/5

Y1 - 1996/5

N2 - A graph is called K1, n-free if it contains no K1, n as an induced subgraph. Let n(≥ 3), r be integers (if r is odd, r ≥ n - 1). We prove that every K1, n-free connected graph G with r|V(G)| even has an r-factor if its minimum degree is at least (n + n-1/r) ⌈n/2(n - 1) r⌉ - n - 1/r (⌈n/2(n - 1) r⌉)2 + n - 3. This degree condition is sharp.

AB - A graph is called K1, n-free if it contains no K1, n as an induced subgraph. Let n(≥ 3), r be integers (if r is odd, r ≥ n - 1). We prove that every K1, n-free connected graph G with r|V(G)| even has an r-factor if its minimum degree is at least (n + n-1/r) ⌈n/2(n - 1) r⌉ - n - 1/r (⌈n/2(n - 1) r⌉)2 + n - 3. This degree condition is sharp.

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

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

M3 - Article

AN - SCOPUS:0030551098

VL - 22

SP - 59

EP - 64

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -