|
Post Reopened by Fedor Petrov, Gil Kalai, Sergei Ivanov, Tony Huynh, Joseph O'Rourke
|
||||
|
|
||||
|
3 | added 33 characters in body | ||
|
Draw the complete graph $K_n$ in the plane [added: in general position] with every edge a straight line and randomly label the edges $0$ or $1$. Does this graph always have a spanning tree with no edges crossing and edge-labels either all $0$ or all $1$? |
||||
|
Post Closed as "too localized" by S. Carnahan♦
|
||||
|
|
||||
|
2 |
edited tags
|
||
|
|
1 |
|
||
