### Abstract

An n-ladder is a balanced bipartite graph with vertex sets A = {a, . . . , a_{n}} and B = {b_{1} , . . . , b_{n}} such that a_{i} ∼ b_{j} 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 language | English (US) |
---|---|

Pages (from-to) | 357-369 |

Number of pages | 13 |

Journal | Discrete Mathematics |

Volume | 257 |

Issue number | 2-3 |

State | Published - Nov 28 2002 |

### Fingerprint

### Keywords

- Bipartite graphs
- Blow-up lemma
- Cycles

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*257*(2-3), 357-369.

**2-factors in dense bipartite graphs.** / Czygrinow, Andrzej; Kierstead, Henry.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 257, no. 2-3, pp. 357-369.

}

TY - JOUR

T1 - 2-factors in dense bipartite graphs

AU - Czygrinow, Andrzej

AU - Kierstead, Henry

PY - 2002/11/28

Y1 - 2002/11/28

N2 - 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.

AB - 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.

KW - Bipartite graphs

KW - Blow-up lemma

KW - Cycles

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

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

M3 - Article

AN - SCOPUS:33750997637

VL - 257

SP - 357

EP - 369

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2-3

ER -