The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges

被引:1
|
作者
Ackerman, Eyal [1 ]
Nitzan, Noa [2 ]
Pinchasi, Rom [2 ]
机构
[1] Univ Haifa, Dept Math Phys & Comp Sci, IL-36006 Tivon, Israel
[2] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel
关键词
Geometric graph; Avoiding edges; Discharging method; Parallel edges; QUASI-PLANAR GRAPHS; PARALLEL EDGES;
D O I
10.1007/s00373-013-1335-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that no line passing through one edge of G meets the relative interior of another edge. We show that in this case the number of edges in G is at most 2n-3.
引用
收藏
页码:1065 / 1072
页数:8
相关论文
共 50 条