Christian pose la question : The crossing number of a graph G, denoted cr(G) is defined to be the minimum number of (pairwise) crossings of edges among all drawings of the graph in the plane. For example, cr(K5)=1 and cr(K3,3)=1. What is cr(K7,7)?
I figured out that the answer is 81.
Now I am trying to figure out if K7,7 can be drawn in the plane with less than 81 crossings?
I'm not sure how to approach this one. Other than actually drawing it out and checking by trial and error, I am not sure how to approach this problem. Please help!
Denis Hanson lui répond.
Page 1/1
Centrale des maths reçoit une aide financière de l’Université de Regina et de The Pacific Institute for the Mathematical Sciences.
