For n = 6, maximum number of edges possible = $6(5)/2 = 15$.
This will be a complete graph of 6 vertices. Each vertex will have the degree 5. (because complete)
To disconnect keeping maximum edges, just isolate a single vertex. => Remove 5 outgoing edges from a vertex.
So, $15-5=10$