2-factors in dense bipartite graphs

Research output: Contribution to journalConference articlepeer-review

11 Scopus citations


An n-ladder is a balanced bipartite graph with vertex sets A = {a, . . . , an} and B = {b1 , . . . , bn} such that ai ∼ bj iff |i - j| ≤ 1. We use techniques developed recently by Komlós et al. (1997) to show that if G = (U, V, E) is a bipartite graph with |U| = n = |V|, with n sufficiently large, and the minimum degree of G is at least n/2 + 1, then G contains an n-ladder. This answers a question of Wang.

Original languageEnglish (US)
Pages (from-to)357-369
Number of pages13
JournalDiscrete Mathematics
Issue number2-3
StatePublished - Nov 28 2002
EventKleitman and Combinatorics: A Celebration - Cambridge, MA, United States
Duration: Aug 16 1990Aug 18 1990


  • Bipartite graphs
  • Blow-up lemma
  • Cycles

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of '2-factors in dense bipartite graphs'. Together they form a unique fingerprint.

Cite this