Alan J. Hoffman
Advances in Computational Mathematics
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
Alan J. Hoffman, Kate Jenkins, et al.
Information Processing Letters
Alan J. Hoffman, Baruch Schieber
Discrete Applied Mathematics
Alan J. Hoffman, Chai Wah Wu
American Mathematical Monthly