Rainbow Trees in Hypercubes
Abstract
We prove that every proper edge-coloring of the n-dimensional hypercube Qn contains a rainbow copy of every tree T on at most n edges. This result is best possible, as Qn can be properly edge-colored using only n colors while avoiding rainbow cycles.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.