Polychromatic Colorings of Subcubes of the Hypercube
Author:
- 1 January 2008
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 22 (2) , 450-454
Abstract
Alon, Krech, and Szabó [SIAM J. Discrete Math., 21 (2007), pp. 66–72] called an edge-coloring of a hypercube with p colors such that every subcube of dimension d contains every color a d-polychromatic p-coloring. Denote by $p_d$ the maximum number of colors with which it is possible to d-polychromatically color any hypercube. We find the exact value of $p_d$ for all values of d.
Keywords
This publication has 5 references indexed in Scilit:
- Turán’s Theorem in the HypercubeSIAM Journal on Discrete Mathematics, 2007
- A Ramsey-type result for the hypercubeJournal of Graph Theory, 2006
- On the maximum number of edges in a c4‐free subgraph of qnJournal of Graph Theory, 1995
- Hexagon‐free subgraphs of hypercubesJournal of Graph Theory, 1993
- Subgraphs of a hypercube containing no small even cyclesJournal of Graph Theory, 1992