Turán number and decomposition number of intersecting odd cycles

Abstract

An extremal graph for a given graph $H$ is a graph on $n$ vertices with maximum number of edges that does not contain $H$ as a subgraph. Let $s,t$ be integers and let $H_{s,t}$ be a graph consisting of $s$ triangles and $t$ cycles of odd lengths at least 5 which intersect in exactly one common vertex. Erdős et al. (1995) determined the extremal graphs for $H_{s,0}$. Recently, Hou et al. (2016) determined the extremal graphs for $H_{0,t}$, where the $t$ cycles have the same odd length $q$ with $q\ge 5$. In this paper, we further determine the extremal graphs for $H_{s,t}$ with $s\ge 0$ and $t\ge 1$. Let $\varphi (n,H)$ be the largest integer such that, for all graphs $G$ on $n$ vertices, the edge set $E(G)$ can be partitioned into at most $\varphi (n,H)$ parts, of which every part either is a single edge or forms a graph isomorphic to $H$. Pikhurko and Sousa conjectured that $ϕ(n,H)=\ex(n,H)$ for $χ(H)\geqs3$ and all sufficiently large $n$. Liu and Sousa (2015) verified the conjecture for $H_{s,0}$. In this paper, we further verify Pikhurko and Sousa's conjecture for $H_{s,t}$ with $s\ge 0$ and $t\ge 1$.

22 pages