2 papers
cs.CG2012
Making Triangles Colorful
Jean Cardinal, Kolja Knauer, Piotr Micek +1
We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at…
math.CO2012
Nonrepetitive choice number of trees
Jakub Kozik, Piotr Micek
A nonrepetitive coloring of a path is a coloring of its vertices such that the sequence of colors along the path does not contain two identical, consecutive blocks. The remarkable…