Geodesic
Regular spanning subgraphs of bipartite graphs of high minimum degree
The electronic journal of combinatorics, Tome 14 (2007)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1022
Classification : 05C70, 05C12
Mots-clés : spanning subgraph, factors of graphs, bipartite graph, bipartition, spanning regular subgraph 
@article{10_37236_1022,
     author = {B\'ela Csaba},
     title = {Regular spanning subgraphs of bipartite graphs of high minimum degree},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/1022},
     zbl = {1157.05322},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1022/}
}
TY  - JOUR
AU  - Béla Csaba
TI  - Regular spanning subgraphs of bipartite graphs of high minimum degree
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1022/
DO  - 10.37236/1022
ID  - 10_37236_1022
ER  - 
%0 Journal Article
%A Béla Csaba
%T Regular spanning subgraphs of bipartite graphs of high minimum degree
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/1022/
%R 10.37236/1022
%F 10_37236_1022
Béla Csaba. Regular spanning subgraphs of bipartite graphs of high minimum degree. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/1022

Cité par Sources :