Discrete Lunch‎ > ‎

Biclique covering and graph coloring

posted Oct 31, 2013, 12:58 AM by Dirk Oliver Theis
Mon, Oct 28, we discussed the connection between Biclique covering and graph coloring.  This connection makes the Log-Rank conjecture in Communication Complexity equivalent to a question about the chromatic number of graphs.
Comments