A note on triangle-free graphs

Abstract

We show that if $G$ is a simple triangle-free graph with $n\ge 3$ vertices, without a perfect matching, and having a minimum degree at least $\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to $K_{\frac{n-1}{2},\frac{n+1}{2}}$.

arXiv comment4 pages, no figures