|
Organizers |
Subgraph Decompositions and Partitions of Arithmetic Sequences
by
Neal Brand
University of North Texas
We consider the problem of partitioning a complete bipartite graph into an ascending subgraph decomposition of paths. This problem reduces to a problem of partitioning arithmetic sequences into equal sum subsets. An algorithm will be presented that produces the desired partition.
Date received: November 13, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafp-16.