Independence number, connectivity, and r‐factors

Research output: Contribution to journalArticlepeer-review

22 Citations (Scopus)


We show that if r ⩾ 1 is an odd integer and G is a graph with |V(G)| even such that k(G) ⩾ (r + 1)2/2 and (r + 1)2α(G) ⩽ 4rk(G), then G has an r‐factor; if r ⩾ 2 is even and G is a graph with k(G) ⩾ r(r + 2)/2 and (r + 2)α(G) ⩽ 4k(G), then G has an r‐factor (where k(G) and α(G) denote the connectivity and the independence number of G, respectively).

Original languageEnglish
Pages (from-to)63-69
Number of pages7
JournalJournal of Graph Theory
Issue number1
Publication statusPublished - 1989 Jan 1
Externally publishedYes

ASJC Scopus subject areas

  • Geometry and Topology


Dive into the research topics of 'Independence number, connectivity, and r‐factors'. Together they form a unique fingerprint.

Cite this