The polychromatic number of small subsets of the integers modulo n

DOI10.1007/S00373-021-02428-0zbMATH Open1485.05056arXiv2007.14468OpenAlexW3046157882MaRDI QIDQ2117519FDOQ2117519

Yanyan Li

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: 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 mod n.

Full work available at URL: https://arxiv.org/abs/2007.14468

zbMATH Keywords

abelian grouppolychromatic coloringcomplement setgroup tiling

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Partitions of sets (05A18) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Turán’s Theorem in the Hypercube
• Tiling the integers with translates of one finite set
• Tiling, packing, and covering by clusters
• Tesselation of integers
• Title not available (Why is that?)
• Polychromatic colorings on the hypercube
• Polychromatic Colorings of Subcubes of the Hypercube
• Polychromatic Colorings on the Integers
• Complements of finite sets of integers
• Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles

This page was built for publication: The polychromatic number of small subsets of the integers modulo \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117519)