crossing number question

241 Views Asked by At

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 ?

1

There are 1 best solutions below

1
On

You may want to look at crossing number inequality of this link.