Ilan Adler, Alan J. Hoffman, et al.
Discrete Applied 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
Don Coppersmith, Alan J. Hoffman
Linear Algebra and Its Applications
Wolfgang W. Bein, Peter Brucker, et al.
Mathematical Programming
Don Coppersmith, Alan J. Hoffman, et al.
Linear Algebra and Its Applications