JOURNAL ARTICLE

Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree

Béla Csaba

Year: 2007 Journal:   The Electronic Journal of Combinatorics Vol: 14 (1)   Publisher: Electronic Journal of Combinatorics

Abstract

Let $G$ be a simple balanced bipartite graph on $2n$ vertices, $\delta = \delta(G)/n$, and $\rho_0={\delta + \sqrt{2 \delta -1} \over 2}$. If $\delta \ge 1/2$ then $G$ has a $\lfloor \rho_0 n \rfloor$-regular spanning subgraph. The statement is nearly tight.

Keywords:
Combinatorics Mathematics Bipartite graph Degree (music) Delta Graph Discrete mathematics Physics

Metrics

15
Cited By
1.08
FWCI (Field Weighted Citation Impact)
8
Refs
0.73
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Limits and Structures in Graph Theory
Physical Sciences →  Mathematics →  Discrete Mathematics and Combinatorics
graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

Minimum Degree Spanning Trees on Bipartite Permutation Graphs

Jacqueline Smith

Journal:   University of Alberta Library Year: 2011
JOURNAL ARTICLE

Toughness, minimum degree, and spanning cubic subgraphs

Douglas C. BauerT. NießenE. F. Schmeichel

Journal:   Journal of Graph Theory Year: 2003 Vol: 45 (2)Pages: 119-141
JOURNAL ARTICLE

Toughness, minimum degree, and spanning cubic subgraphs

Douglas C. BauerT. NiessenE. Schmeichel

Journal:   Journal of Graph Theory Year: 2004 Vol: 46 (2)Pages: 144-144
JOURNAL ARTICLE

Highly Connected Graphs Have Highly Connected Spanning Bipartite Subgraphs

Raphael Yuster

Journal:   The Electronic Journal of Combinatorics Year: 2024 Vol: 31 (1)
© 2026 ScienceGate Book Chapters — All rights reserved.