What is the minimum value of the independence number for a bipartite graph on n vertices?

Question

Counts

Good afternoon.
Difficulties arose with a seemingly simple question: what is the minimum value of the independence number for a bipartite graph on n vertices (for n >= 10)?
I argued that if we have a bipartite graph, then in the worst case, both subsets of vertices are equal to n/2, and therefore the minimum value of the independence number will be n/2. And a picture for my reasoning:

Answer 1

What if n is odd?
:)