A note on triangle-free graphs
Vahan Mkrtchyan, Petros A. Petrosyan · arXiv (Cornell University) · 2011
We show that if $G$ is a simple triangle-free graph with $n\geq 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}}$.