If a simple connected graph $G$ is non-bipartite and has a chromatic number $\chi(G) = 3$, what is the minimum possible number of edges the graph can have relative to the number of vertices $n$?