Sciweavers

66
Voted
COMPGEOM
2006
ACM
15 years 2 months ago
On the maximum number of edges in topological graphs with no four pairwise crossing edges
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
Eyal Ackerman