Disjoint subsets of integers having a constant sum
From MaRDI portal
A necessary and sufficient condition, in terms of n,k, and m, is given for the existence of k disjoint subsets of the set of the first n natural numbers, such that the sum in each of the subsets is m.
Recommendations
- Disjoint odd integer subsets having a constant even sum
- Disjoint odd integer subsets having a constant odd sum
- Integer sets with distinct subset sums
- Integer Sets with Distinct Subset-Sums
- Disjoint sets of distinct sum sets
- A construction for sets of integers with distinct subset sums
- On sums of subsets of a set of integers
- Disjoint Pairs with Distinct Sums
- Subset and subsequence sums in integers
Cited in
(13)- Disjoint odd integer subsets having a constant odd sum
- Disjoint odd integer subsets having a constant even sum
- Centrally symmetric and magic rectangles
- Constant sum partition of sets of integers and distance magic graphs
- On the ascending subgraph decomposition problem for bipartite graphs
- On the sumset partition problem
- Problems on integer decomposition
- Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
- On the modular sumset partition problem
- Integer sets with distinct subset sums
- On ascending subgraph decomposition of graphs
- On star forest ascending subgraph decomposition
- A note on graph burning of path forests
This page was built for publication: Disjoint subsets of integers having a constant sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809077)
