J. Comb. Theory Ser. A

Paper

01 Feb 2001

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

Paper

On greedy algorithms for series parallel graphs

Alan J. Hoffman

Mathematical Programming

Paper

Maximum degree in graphs of diameter 2

Paul Erdös, Siemion Fajtlowicz, et al.

Networks

Paper

The edge versus path incidence matrix of series-parallel graphs and greedy packing

Alan J. Hoffman, Baruch Schieber

Discrete Applied Mathematics

Paper

A simple proof of a generalized Cauchy-Binet theorem

Alan J. Hoffman, Chai Wah Wu

American Mathematical Monthly

View all publications