2-Factors of bipartite graphs with asymmetric minimum degrees

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Let G and H be balanced U, V-bigraphs on 2n vertices with δ (H) ≤ 2. Let κ be the number of components of H, δU := min{deg G(υ): υ ∈ U} and δv := min{deg G(υ): υ G V}. We prove that if n is sufficiently large and δU +δV ≥ n+κ, then G contains H. This answers a question of Amar in the case that n is large. We also show that G contains H even when δU + δV ≥ n + 2 as long as n is sufficiently large in terms of κ and δ(G) ≥ n/200κ + 1.

Original languageEnglish (US)
Pages (from-to)486-504
Number of pages19
JournalSIAM Journal on Discrete Mathematics
Issue number2
StatePublished - 2010


  • 2-factors
  • Bipartite graphs
  • Blow-up lemma
  • Regularity lemma
  • Spanning cycles

ASJC Scopus subject areas

  • Mathematics(all)


Dive into the research topics of '2-Factors of bipartite graphs with asymmetric minimum degrees'. Together they form a unique fingerprint.

Cite this