Highly symmetric subgraphs of hypercubes
This paper mainly concentrates on the following two questions: (i) How many colors are needed for a coloring of the \(n\)-cube without monochromatic quadrangles or hexagons? It is shown that four colors suffice, and thereby the authors settle a problem of Erdős. (ii) Which vertex-transitive induced subgraphs does a hypercube have? It is shown that by deleting 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.
- Hexagon-free subgraphs of hypercubes
- scientific article; zbMATH DE number 3873360 (Why is no real title available?)
- scientific article; zbMATH DE number 4164941 (Why is no real title available?)
- scientific article; zbMATH DE number 19183 (Why is no real title available?)
- scientific article; zbMATH DE number 193034 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On edge but not vertex transitive regular graphs
- On generalized hexagons and a near octagon whose lines have three points
- Subgraphs of a hypercube containing no small even cycles
- On symmetric subgraphs of the 7-cube: An overview
- Subgraphs of hypercubes and subdiagrams of Boolean lattices
- Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- Regular subgraphs of hypercubes
- From the Coxeter graph to the Klein graph
- Hexagon-free subgraphs of hypercubes
- Subgraphs of a hypercube containing no small even cycles
- Links between two semisymmetric graphs on 112 vertices via association schemes
- On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs
- Counting subgraphs in hyperbolic graphs with symmetry
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
- Hypercube embeddings and Cayley graphs generated by transpositions
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
- Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
- On efficient total colorings of regular graphs
- Total colorings of k-regular graphs of girths 2k and k
- A hierarchical structure of the quad-cube and the associated diameter, domination, and Hamiltonicity
- \(C_{10}\) has positive Turán density in the hypercube
- Distance-residual subgraphs
This page was built for publication: Highly symmetric subgraphs of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686980)
