Disjoint subsets of integers having a constant sum

DOI10.1016/0012-365X(90)90040-OzbMath0732.05002OpenAlexW2083010603MaRDI QIDQ809077

Kiyoshi Ando, Mikio Kano, Severino V. Gervacio

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90040-o

zbMATH Keywords

partitions of integersdisjoint subsets

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75)

Related Items (10)

On the ascending subgraph decomposition problem for bipartite graphs ⋮ Disjoint odd integer subsets having a constant even sum ⋮ On ascending subgraph decomposition of graphs ⋮ Centrally symmetric and magic rectangles ⋮ On the modular sumset partition problem ⋮ Constant sum partition of sets of integers and distance magic graphs ⋮ On star forest ascending subgraph decomposition ⋮ On the Sumset Partition Problem ⋮ Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs ⋮ Disjoint odd integer subsets having a constant odd sum

This page was built for publication: Disjoint subsets of integers having a constant sum