2-factors in dense bipartite graphs

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

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
Volume257
Issue number2-3
StatePublished - Nov 28 2002

Fingerprint

Ladders
Bipartite Graph
Minimum Degree
Vertex of a graph

Keywords

  • Bipartite graphs
  • Blow-up lemma
  • Cycles

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

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

In: Discrete Mathematics, Vol. 257, No. 2-3, 28.11.2002, p. 357-369.

Research output: Contribution to journalArticle

@article{bd62e777c87243a6a4917c1b0d6c1646,
title = "2-factors in dense bipartite graphs",
abstract = "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{\'o}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.",
keywords = "Bipartite graphs, Blow-up lemma, Cycles",
author = "Andrzej Czygrinow and Henry Kierstead",
year = "2002",
month = "11",
day = "28",
language = "English (US)",
volume = "257",
pages = "357--369",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2-3",

}

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 -