On the minimum order of a maximal independent set in cycle graphs and path graphs
The smallest maximal independent set in a cycle or path of length $n$ clearly has size about $n/3$. This can be seen by inspection and certainly doesn't need anything like Tur&aacute;n's theorem.