Timeline for Is there any known upper bound for the local crossing number of a graph drawing in the plane?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11 at 23:10 | answer | added | asdasd | timeline score: 2 | |
| Nov 11 at 10:24 | comment | added | RavenclawPrefect | Sure: if $G$ has $n$ edges, then placing points randomly in the plane and using straight-line edges will yield at most $n-1$ crossings of a single edge. Not a very good upper bound, but it's certainly a known one! | |
| Nov 10 at 16:31 | history | asked | Xin Zhang | CC BY-SA 4.0 |