Campuses:

Biclique Decomposition of Random Graphs

Tuesday, December 9, 2014 - 2:00pm - 3:00pm
Lind 305
Hao Huang (University of Minnesota, Twin Cities)
The biclique partition number bp(G) is the minimum number of complete bipartite graphs needed to partition the edges of a graph G. It is not hard to see that bp(G) 0 such that for G=G(n, 0.5), bp(G)