## Abstract We prove that for __d__ β₯ 4, __d__ β 5, the edges of the __d__βdimensional cube can be colored by __d__ colors so that all quadrangles have four distinct colors. Β© 1993 John Wiley & Sons, Inc.
On the coloration of cubes
β Scribed by Walter Taylor
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 393 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A sequence of positive integers with positive lower density contains a Hilbert (or combinatorial) cube size c log log n up to n. We prove that c log log n cannot be replaced by c$ -log n log log n. ## 1999 Academic Press In [1] D. Hilbert showed (using different terminology) that for any k 1, if N
Chen, W.Y.C. and R.P. Stanley, Derangements on the n-cube, Discrete Mathematics 115 (1993) 65-15. Let Q. be the n-dimensional cube represented by a graph whose vertices are sequences of O's and l's of length n, where two vertices are adjacent if and only if they differ only at one position. A k-dime