Recommendations
Cites work
- scientific article; zbMATH DE number 2192164 (Why is no real title available?)
- An anti-Ramsey theorem
- Bipartite anti-Ramsey numbers of cycles
- Edge-colorings of complete graphs that avoid polychromatic trees
- On an anti‐Ramsey property of Ramanujan graphs
- Rainbow numbers for matchings and complete graphs
- Subgraphs of a hypercube containing no small even cycles
- \(E_{11}\) and M theory
Cited in
(24)- Rainbow coloring the cube
- Turán’s Theorem in the Hypercube
- Rainbow copies of \(C_4\) in edge-colored hypercubes
- Anti-Ramsey numbers in complete split graphs
- Antipodal edge-colorings of hypercubes
- Anti-Ramsey number of Hanoi graphs
- Anti-Ramsey numbers for cycles in \(n\)-prisms
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Vertex rainbow numbers for cube graphs
- Anti-Ramsey problems for cycles
- Rainbow generalizations of Ramsey theory: A survey
- On the Turán number of the hypercube
- A remark on rainbow 6-cycles in hypercubes
- Saturated rainbow edge colorings of cube graphs
- Polychromatic colorings on the hypercube
- Hypercube 1-factorizations from extended Hamming codes
- On heterochromatic out-directed spanning trees in tournaments
- Avoiding rainbow 2-connected subgraphs
- Number of proper paths in edge-colored hypercubes
- Rainbow cycles in cube graphs
- Anti-Ramsey numbers in complete \(k\)-partite graphs
- A note on short cycles in a hypercube
- Coloring the cube with rainbow cycles
- Symmetric Layer-Rainbow Colorations of Cubes
This page was built for publication: Rainbows in the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879943)
