pith. sign in

arxiv: 0708.0202 · v2 · submitted 2007-08-01 · 🧮 math.CO

Regular spanning subgraphs of bipartite graphs of high minimum degree

classification 🧮 math.CO
keywords deltabipartiteregularspanningbalanceddegreegraphgraphs
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.