Linear polychromatic colorings of hypercube faces
The electronic journal of combinatorics, Tome 25 (2018) no. 1
A coloring of the $\ell$-dimensional faces of $Q_n$ is called $d$-polychromatic if every embedded $Q_d$ has every color on at least one face. Denote by $p^\ell(d)$ the maximum number of colors such that any $Q_n$ can be colored in this way. We provide a new lower bound on $p^\ell(d)$ for $\ell > 1$.
DOI :
10.37236/6455
Classification :
05C15, 05C35
Mots-clés : polychromatic, coloring, hypercube
Mots-clés : polychromatic, coloring, hypercube
Affiliations des auteurs :
Evan Chen  1
@article{10_37236_6455,
author = {Evan Chen},
title = {Linear polychromatic colorings of hypercube faces},
journal = {The electronic journal of combinatorics},
year = {2018},
volume = {25},
number = {1},
doi = {10.37236/6455},
zbl = {1386.05055},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6455/}
}
Evan Chen. Linear polychromatic colorings of hypercube faces. The electronic journal of combinatorics, Tome 25 (2018) no. 1. doi: 10.37236/6455
Cité par Sources :