Highly symmetric subgraphs of hypercubes
Journal of Algebraic Combinatorics, Tome 2 (1993) no. 1, pp. 25-29.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: Two questions are considered, namely (i) How many colors are needed for a coloring of the $n$-cube without monochromatic quadrangles or hexagons? We show that four colors suffice and thereby settle a problem of Erdös. (ii) Which vertex-transitive induced subgraphs does a hypercube have? An interesting graph has come up in this context: If we delete a Hamming code from the 7-cube, the resulting graph is 6-regular, vertex-transitive and its edges can be two-colored such that the two monochromatic subgraphs are isomorphic, cubic, edge-transitive, nonvertex-transitive graphs of girth 10.
Keywords: edge-coloring, hypercube, vertex-transitive subgraph
@article{JAC_1993__2_1_a4,
     author = {Brouwer, A.E. and Dejter, I.J. and Thomassen, C.},
     title = {Highly symmetric subgraphs of hypercubes},
     journal = {Journal of Algebraic Combinatorics},
     pages = {25--29},
     publisher = {mathdoc},
     volume = {2},
     number = {1},
     year = {1993},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JAC_1993__2_1_a4/}
}
TY  - JOUR
AU  - Brouwer, A.E.
AU  - Dejter, I.J.
AU  - Thomassen, C.
TI  - Highly symmetric subgraphs of hypercubes
JO  - Journal of Algebraic Combinatorics
PY  - 1993
SP  - 25
EP  - 29
VL  - 2
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JAC_1993__2_1_a4/
LA  - en
ID  - JAC_1993__2_1_a4
ER  - 
%0 Journal Article
%A Brouwer, A.E.
%A Dejter, I.J.
%A Thomassen, C.
%T Highly symmetric subgraphs of hypercubes
%J Journal of Algebraic Combinatorics
%D 1993
%P 25-29
%V 2
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JAC_1993__2_1_a4/
%G en
%F JAC_1993__2_1_a4
Brouwer, A.E.; Dejter, I.J.; Thomassen, C. Highly symmetric subgraphs of hypercubes. Journal of Algebraic Combinatorics, Tome 2 (1993) no. 1, pp. 25-29. http://geodesic.mathdoc.fr/item/JAC_1993__2_1_a4/