A note on packing graphs without cycles of length up to five (Q2380220)

Summary: The following statement was conjectured by \textit{R. J. Faudree, C. C. Rousseau, R. H. Schelp} and \textit{S. Schuster} [Czech. Math. J. 31(106), 53--62 (1981; Zbl 0479.05028)]: if a graph \(G\) is a non-star graph without cycles of length \(m\geq 4\), then \(G\) is a subgraph of its complement. So far the best result concerning this conjecture is that every non-star graph \(G\) without cycles of length \(m\leq 6\) is a subgraph of its complement. In this note we show that \(m\leq 6\) can be replaced by \(m\leq 5\).