Linear polychromatic colorings of hypercube faces
The electronic journal of combinatorics, Tome 25 (2018) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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

Evan Chen  1

1 Massachussetts Institute of Technology
@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/}
}
TY  - JOUR
AU  - Evan Chen
TI  - Linear polychromatic colorings of hypercube faces
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6455/
DO  - 10.37236/6455
ID  - 10_37236_6455
ER  - 
%0 Journal Article
%A Evan Chen
%T Linear polychromatic colorings of hypercube faces
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/6455/
%R 10.37236/6455
%F 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 :