Regular spanning subgraphs of bipartite graphs of high minimum degree

被引：0

作者：

Csaba, Bela ^{[1
]}

机构：

[1] Hungarian Acad Sci, Univ Szeged, Anal & Stochast Res Grp, H-1051 Budapest, Hungary

[2] Western Kentucky Univ, Dept Math, Bowling Green, KY 42101 USA

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2007年 / 14卷 / 01期

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let G be a simple balanced bipartite graph on 2n vertices, delta = delta(G)/n, and rho(0) = delta+root 2 delta-1/2. If delta >= 1/2 then G has a [rho(0)n]-regular spanning subgraph. The statement is nearly tight.

引用

页数：7

共 7 条

[1] REGULAR FACTORS OF REGULAR GRAPHS [J].

BOLLOBAS, B ;

SAITO, A ;

WORMALD, NC .

JOURNAL OF GRAPH THEORY, 1985, 9 (01) :97-103

[2]

CSABA B, UNPUB APPROXIMATING

[3]

CSABA B, APPROXIMATE MULTIPAR

[4]

KRAUSE M, 1996, AM MATH MONTHLY, V4, P335

[5]

Lovasz L., 1993, COMBINATORIAL PROBLE

[6]

Ryser H. J., 1963, COMBINATORIAL MATH, DOI DOI 10.5948/UPO9781614440147

[7] THE FACTORS OF GRAPHS [J].

TUTTE, WT .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1952, 4 (03) :314-328

← 1 →