On the modular sumset partition problem
From MaRDI portal
Recommendations
Cites work
- A note on ascending subgraph decompositions of complete multipartite graphs
- A SURVEY OF PROBLEMS AND RESULTS ON RESTRICTED SUMSETS
- Additive Latin transversals.
- Ascending subgraph decompositions of regular graphs
- Combinatorial Nullstellensatz
- Cycle-magic graphs
- Disjoint subsets of integers having a constant sum
- scientific article; zbMATH DE number 4043890 (Why is no real title available?)
- scientific article; zbMATH DE number 4057554 (Why is no real title available?)
- scientific article; zbMATH DE number 812094 (Why is no real title available?)
- On the ascending star subgraphs decomposition of star forests
- On the sumset partition problem
- Partition of a set of integers into subsets with prescribed sums
- The difference between consecutive primes. II
- Transversals of additive Latin squares
Cited in
(10)- On balanced sets mod p
- 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
- 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 the ascending subgraph decomposition problem for bipartite graphs
- On the sumset partition problem
- On star forest ascending subgraph decomposition
- Zero-sum partitions of abelian groups and their applications to magic- and antimagic-type labelings
- A note on graph burning of path forests
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)