no. 6 · Monday 2 November 2026
On the Turán number for the Cartesian product of an odd cycle and a tree
Abstract
Let $T$ be a fixed tree on at least two vertices. We determine the Turán number and all extremal graphs for the Cartesian product of an odd cycle $C_{2m+1}$ and $T$, for every fixed integer $m\ge1$ and all sufficiently large $n$, in terms of its decomposition family. Every extremal graph is the join of an independent set and an extremal graph for that family. The proof combines the Erdős–Sós theorem with weak stability and progressive induction.
- comments
- 16 pages
- fields
- Combinatorics