Prove that there exists constant k such that, for all $5v < e$ there is a subgraph of the complete graph of $v$ vertics with crossing number less or equal than $ k e^3/v^2$.
Any hints for a way to apply probabilistic argument ?
You may want to look at crossing number inequality of this link.
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
2 years ago
1 year ago