The maximum number of edges in geometric graphs with pairwise virtually avoiding edges

DOI10.1007/s00373-013-1335-7zbMath1298.05082OpenAlexW2047512733MaRDI QIDQ742617

Eyal Ackerman, Noa Nitzan, Rom Pinchasi

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1335-7

zbMATH Keywords

geometric graphdischarging methodavoiding edgesparallel edges

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Extremal problems for pairs of triangles

Cites Work

• On the maximum number of edges in quasi-planar graphs
• Geometric graphs with no two parallel edges
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• Crossing families
• Quasi-planar graphs have a linear number of edges
• On geometric graphs with no two edges in convex position
• On geometric graphs with no \(k\) pairwise parallel edges
• On the number of directions determined by a three-dimensional points set
• Research Problems in Discrete Geometry

This page was built for publication: The maximum number of edges in geometric graphs with pairwise virtually avoiding edges