ISSN:
1439-6912
Keywords:
AMS Subject Classification (1991) Classes: 05C35
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s004939970002
Permalink