Alan J. Hoffman
Linear Algebra and Its Applications
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
Arlette Gaillard, Heinz Groeflin, et al.
Theoretical Computer Science
B.Curtis Eaves, Alan J. Hoffman, et al.
Mathematical Programming
Alan J. Hoffman, Arthur F. Veinott Jr.
Mathematical Programming