The maximum number of triangles in graphs without large linear forests

MaRDI QIDQ6311494zbMATH OpenFDO

Authors Xiuzhuan Duan, Jian Wang, Weihua Yang

Publication date 21 December 2018

Abstract: 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 maximum number of edges, which is a linear forest. We denote by $l(G)$ this maximum number. Let $t=leftlfloor(k-1)/2ightfloor$. Recently, Ning and Wang cite{boning} proved that if $l(G)=k-1$, then for any $k<n$ [ e(G) leq max left{�inom{k}{2},�inom{t}{2}+t (n - t)+ c ight}, ] where $c=0$ if $k$ is odd and $c=1$ otherwise, and the inequality is tight. In this paper, we prove that if $l(G)=k-1$ and $delta(G)=delta$ ($delta<lfloork/2floor$), then for any $k<n$ [ e(G) leq max left{�inom{k-delta}{2}+delta(n-k+delta),�inom{t}{2}+tleft(n-t ight)+c ight}. ] When $delta=0$, it reduces to Ning and Wang's result. Moreover, let $r_3(G)$ be the number of triangles in $G$. We prove that if $l(G)=k-1$ and $delta(G)=delta$, then for any $k<n$ [ r_3(G)leq max left{�inom{k-delta}{3}+�inom{delta}{2}(n-k+delta),�inom{t}{3}+�inom{t}{2}left(n-t ight)+d ight}. ] where $d=0$ if $k$ is odd and $d=t$ otherwise.

This page was built for publication: The maximum number of triangles in graphs without large linear forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6311494)