Disjoint subsets of integers having a constant sum

DOI10.1016/0012-365X(90)90040-OzbMATH Open0732.05002OpenAlexW2083010603MaRDI QIDQ809077FDOQ809077

Kiyoshi Ando, Severino V. Gervacio, Mikio Kano

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)

Cited In (11)

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

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)