# Is a matching $M$ maximum iff the graph doesn't have an augmenting path wrt $M$?

Berge's theorem: a matching $M$ is maximum if and only if the graph doesn't have an augmenting path with respect to $M$.

I don't understand this theorem. For instance the following matching is maximum but has an augmenting path, doesn't it?

The matching $M$ is in gold here and the augmenting path is the one in dotted lines.