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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved queue-size scaling for input-queued switches via graph factorization;Advances in Applied Probability;2020-09
2. Improved Queue-Size Scaling for Input-Queued Switches via Graph Factorization;ACM SIGMETRICS Performance Evaluation Review;2019-12-17
3. Improved Queue-Size Scaling for Input-Queued Switches via Graph Factorization;Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems;2019-06-20
4. Random partitions and edge-disjoint Hamiltonian cycles;Journal of Combinatorial Theory, Series B;2013-11
5. Avoiding Arrays of Odd Order by Latin Squares;Combinatorics, Probability and Computing;2012-12-21