Skip to main content
Research
J. Comb. Theory Ser. A
Paper

On a problem of Zaks

View publication

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

View all publications