On the modular sumset partition problem
From MaRDI portal
Publication:412228
DOI10.1016/j.ejc.2011.09.001zbMath1239.05021MaRDI QIDQ412228
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.001
05A18: Partitions of sets
05A17: Combinatorial aspects of partitions of integers
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On the ascending subgraph decomposition problem for bipartite graphs, On star forest ascending subgraph decomposition, Constant sum partition of sets of integers and distance magic graphs, Zero sum partition of abelian groups into sets of the same order and its applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjoint subsets of integers having a constant sum
- On the ascending star subgraphs decomposition of star forests
- Additive Latin transversals.
- Ascending subgraph decompositions of regular graphs
- A note on ascending subgraph decompositions of complete multipartite graphs
- Cycle-magic graphs
- Partition of a set of integers into subsets with prescribed sums
- The Difference Between Consecutive Primes, II
- On the Sumset Partition Problem
- Combinatorial Nullstellensatz
- A SURVEY OF PROBLEMS AND RESULTS ON RESTRICTED SUMSETS
- Transversals of additive Latin squares