Proper edge coloring with 6 colors means a vertex can be connected with at max 6 edges. So maximum deg of any vertex in the graph G is 6. Total number of vertices is 20. So , 6 * 20 >= 2*|E| (E =number of edges)
So, 60 >= |E| .The maximum number of edges in Gcan be 60.