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

Katsuhiro Ota, Taro Tokuda

研究成果: Article

16 引用 (Scopus)

抜粋

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.

元の言語English
ページ(範囲)59-64
ページ数6
ジャーナルJournal of Graph Theory
22
発行部数1
DOI
出版物ステータスPublished - 1996 5

ASJC Scopus subject areas

  • Geometry and Topology

フィンガープリント A Degree Condition for the Existence of Regular Factors in K<sub>1</sub>, <sub>n</sub>-Free Graphs' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用