Let be the bipartite graph with vertices and edges and suppose . Find a constant and (for sufficiently large n) an explicit -regular partition of into pieces. Also, how can you show that there is not a constant such that every has a partition into (almost) equal vertex classes in whicheverypair is -regular?