The Polychromatic Number of Small Subsets of the Integers Modulo n

Emelie Curl,John Goldwasser,Joe Sampson,Michael Young

Graphs and Combinatorics（2022）

引用 0|浏览5

暂无评分

摘要

If S is a subset of an abelian group G , the polychromatic number of S in G is the largest integer k so that there is a k -coloring of the elements of G such that every translate of S in G gets all k colors. We determine the polychromatic number of all sets of size 2 or 3 in the group of integers n .

查看译文

关键词

Polychromatic coloring, Abelian group, Group tiling, Complement set

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要