### 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 |

DOIs | |

State | Published - Nov 28 2002 |

Event | Kleitman and Combinatorics: A Celebration - Cambridge, MA, United States Duration: Aug 16 1990 → Aug 18 1990 |

### Fingerprint

### Keywords

- Bipartite graphs
- Blow-up lemma
- Cycles

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics