Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!
I The complete graph K_n can be expressed as the union of k bipartite graphs iff n≤2^k
Tags:
Have something to add?
 Similar Discussions: The complete graph K_n can be expressed as the union of k bipartite graphs iff n≤2^k

Drawing an ncube graph as bipartite (Replies: 1)

Algorithm or expression to put n elements in k sets (Replies: 3)

Counting edge numbers in bipartite graphs (Replies: 1)
Loading...