Turán number and decomposition number of intersecting odd cycles

Xinmin Hou, Yu Qiu, Boyuan Liu

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…