Regular spanning subgraphs of bipartite graphs of high minimum degree (Q1010593)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5540821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regular spanning subgraphs of bipartite graphs of high minimum degree |
scientific article; zbMATH DE number 5540821 |
Statements
Regular spanning subgraphs of bipartite graphs of high minimum degree (English)
0 references
7 April 2009
0 references
Summary: Let \(G\) be a simple balanced bipartite graph on \(2n\) vertices, \(\delta = \delta(G)/n\), and \(\rho_0=\frac {\delta+\sqrt{2\delta-1}}{2}\). If \(\delta \geq 1/2\) then \(G\) has a \(\lfloor \rho_0 n \rfloor\)-regular spanning subgraph. The statement is nearly tight.
0 references
spanning subgraph
0 references
factors of graphs
0 references
bipartite graph
0 references
bipartition
0 references
spanning regular subgraph
0 references
0.8281329274177551
0 references
0.8268075585365295
0 references
0.821094810962677
0 references
0.8205593228340149
0 references
0.811601459980011
0 references
