On the modular sumset partition problem
From MaRDI portal
Publication:412228
DOI10.1016/J.EJC.2011.09.001zbMATH Open1239.05021OpenAlexW2063365806MaRDI QIDQ412228FDOQ412228
Authors: Jordi Moragas, Anna Lladó 
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
Recommendations
Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The difference between consecutive primes. II
- On the ascending star subgraphs decomposition of star forests
- Ascending subgraph decompositions of regular graphs
- A note on ascending subgraph decompositions of complete multipartite graphs
- Partition of a set of integers into subsets with prescribed sums
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Nullstellensatz
- Title not available (Why is that?)
- Disjoint subsets of integers having a constant sum
- Cycle-magic graphs
- Additive Latin transversals.
- On the sumset partition problem
- A SURVEY OF PROBLEMS AND RESULTS ON RESTRICTED SUMSETS
- Transversals of additive Latin squares
Cited In (7)
- On the ascending subgraph decomposition problem for bipartite graphs
- Zero sum partition of abelian groups into sets of the same order and its applications
- Constant sum partition of sets of integers and distance magic graphs
- Algorithms for enumeration problem of linear congruence modulo \(m\) as sum of restricted partition numbers
- Partition of a set of integers into subsets with prescribed sums
- On balanced sets mod p
- On star forest ascending subgraph decomposition
This page was built for publication: On the modular sumset partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412228)
