A graph $G$ is $k$-chromatic with $V=15$ vertices. If $\omega(G) = 3$ and the graph is a split graph, what is the maximum number of edges it can have?