Proves that graphs on N ≥ 2n vertices with δ(G) ≥ ⌊3N/4⌋ have every 2-edge-coloring containing a monochromatic copy of every n-vertex tree with max degree ≤ Δ.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A degree version of the Burr-Erd\H{o}s conjecture on trees
Proves that graphs on N ≥ 2n vertices with δ(G) ≥ ⌊3N/4⌋ have every 2-edge-coloring containing a monochromatic copy of every n-vertex tree with max degree ≤ Δ.