Ulrich Faigle, Alan J. Hoffman, et al.
SIAM Journal on Discrete 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
Terrence R. Scott, Alan J. Hoffman
IEEE Transactions on Circuits and Systems
Alan J. Hoffman, Arthur F. Veinott Jr.
Mathematical Programming
Alan J. Hoffman
Linear Algebra and Its Applications