The maximum number of triangles in graphs without large linear forests

Xiuzhuan Duan, Jian Wang, Weihua Yang

Let $G$ be a graph on $n$ vertices. A linear forest is a graph consisting of vertex-disjoint paths and isolated vertices. A maximum linear forest of $G$ is a subgraph of $G$ with m…