We may improve the upper bound in the absence of an induced subgraph. We have two candidates to forbid. We denote by \(K_{n,m}\) , the complete bipartite graph for any \(n,m\ge 1\) . In particular, the graph \(K_{1,3}\)  is known as the claw. Once again, the proof of the following is almost identical to that of [1]}.
