New answers tagged graph-drawing
2
votes
Is there any known upper bound for the local crossing number of a graph drawing in the plane?
There are constant-degree graphs with local crossing number $\Omega(m)$, where $m = |E(G)|$, for example constant-degree expander graphs (the crossing number of expander graphs is $\Omega(m^2)$, since ...
Top 50 recent answers are included
Related Tags
graph-drawing × 52graph-theory × 48
co.combinatorics × 29
discrete-geometry × 14
planar-graphs × 14
gt.geometric-topology × 7
topological-graph-theory × 7
reference-request × 6
graph-colorings × 3
ag.algebraic-geometry × 2
mg.metric-geometry × 2
ho.history-overview × 2
computational-geometry × 2
polyhedra × 2
embeddings × 2
pr.probability × 1
computer-science × 1
permutations × 1
plane-geometry × 1
combinatorial-optimization × 1
posets × 1
lattice-theory × 1
enumerative-combinatorics × 1
counterexamples × 1
simplicial-complexes × 1