In the hypercube, the rainbow extremal number of any k-edge tree is conjectured to depend only on k, and the paper verifies this for several infinite families.
Subgraphs of a hypercube containing no small eve n cycles
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Rainbow Erd\H{o}s-S\'os Conjectures
In the hypercube, the rainbow extremal number of any k-edge tree is conjectured to depend only on k, and the paper verifies this for several infinite families.