Alan J. Hoffman
Aequationes Mathematicae
Paper
On a problem of Zaks
Abstract
Let Mm be a matching with m edges, n≥2m. We prove that the smallest number of complete bipartite graphs which partition the edges of Kn+Mm is at least n-m+⌊2m⌋-1. © 2001 Academic Press.
Related
Terrence R. Scott, Alan J. Hoffman
IEEE Transactions on Circuits and Systems
Alan J. Hoffman
Advances in Computational Mathematics
Alan J. Hoffman, Baruch Schieber
Discrete Applied Mathematics