![]() |
Necessary and sufficient conditions for packing half-regular subgraphs with given degree sequences in a complete bipartite graph were given by Aksen, Miklos and Zhou. In this note, by using the Konig-Hall theorem on bipartite matchings, we give a simpler proof for this result.
Bibtex entry:
| AUTHOR | = | {B{\'e}rczi, Krist{\'o}f}, |
| TITLE | = | {A note on packing half-regular bipartite graphs}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2016}, |
| NUMBER | = | {QP-2016-01} |