Skip to main content

Research Repository

Advanced Search

Unbalanced bipartite factorizations of complete bipartite graphs

Martin, Nigel

Authors

Nigel Martin



Abstract

We construct a new infinite family of factorizations of complete bipartite graphs by factors all of whose components are copies of a (fixed) complete bipartite graph $K_{p,q}. There are simple necessary conditions for such factorizations to exist. The family constructed here demonstrates sufficiency in many new cases. In particular, the conditions are always sufficient when $q=p+1$.

Citation

Martin, N. (2006). Unbalanced bipartite factorizations of complete bipartite graphs. Discrete Mathematics, 306(17), 2084-2090. https://doi.org/10.1016/j.disc.2006.04.004

Journal Article Type Article
Publication Date 2006-09
Deposit Date Mar 26, 2008
Publicly Available Date Mar 29, 2024
Journal Discrete mathematics.
Print ISSN 0012-365X
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 306
Issue 17
Pages 2084-2090
DOI https://doi.org/10.1016/j.disc.2006.04.004
Keywords Factorization, Complete bipartite graph.

Files




You might also like



Downloadable Citations