has a bipartite subgraph of size at least \(\). We show that every graph of size \(\) has a bipartition in which the Edwards bound holds, and in addition each vertex class contains at most \(\) edges. This is exact for complete graphs of odd order, which we show are the only extremal graphs without isolated vertices. We also give results for partitions into more than two classes.
Unable to display preview. Download preview PDF.