On the problem of partitioning into subsets having equal sums

Authors:
H. Joseph Straight and Paul Schillo

Journal:
Proc. Amer. Math. Soc. **74** (1979), 229-231

MSC:
Primary 05C38; Secondary 10A45

DOI:
https://doi.org/10.1090/S0002-9939-1979-0524291-0

MathSciNet review:
524291

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Let *N* denote the set of natural numbers and let . For *S* a finite subset of *N*, let denote the sum of the elements in *S*. Then . Suppose , where *s* and *t* are integers and . We show that can be partitioned into such that , for . Such a partition is called an (*s, t*)-partition of .

A graph *G* having edges is said to be path-perfect if the edge set of *G* can be partitioned as so that induces a path of length *i*, for . Suppose *p* and *n* are positive integers and *r* is an even positive integer with and . The existence of an (*r*/2, *p*)-partition of is used to show the existence of an *r*-regular path-perfect graph *G* having *p* vertices and edges.

**[1]**J. F. Fink and H. J. Straight,*Path-perfect graphs*, Discrete Math. (to appear). MR**597232 (82a:05077)****[2]**F. Harary,*Graph theory*, Addison-Wesley, Reading, Mass., 1971. MR**0256911 (41:1566)****[3]**H. J. Straight,*Partitions of the vertex set or edge set of a graph*, Doctoral Dissertation, Western Michigan University, 1977.

Retrieve articles in *Proceedings of the American Mathematical Society*
with MSC:
05C38,
10A45

Retrieve articles in all journals with MSC: 05C38, 10A45

Additional Information

DOI:
https://doi.org/10.1090/S0002-9939-1979-0524291-0

Article copyright:
© Copyright 1979
American Mathematical Society