当前位置: X-MOL 学术J. Graph Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Drawings of complete graphs in the projective plane
Journal of Graph Theory ( IF 0.9 ) Pub Date : 2021-03-23 , DOI: 10.1002/jgt.22665
Alan Arroyo 1 , Dan McQuillan 2 , R. Bruce Richter 3 , Gelasio Salazar 4 , Matthew Sullivan 3
Affiliation  

Hill's Conjecture states that the crossing number cr ( K n ) of the complete graph K n in the plane (equivalently, the sphere) is 1 4 n 2 n 1 2 n 2 2 n 3 2 = n 4 64 + O ( n 3 ) . Moon proved that the expected number of crossings in a spherical drawing in which the points are randomly distributed and joined by geodesics is precisely n 4 64 + O ( n 3 ) , thus matching asymptotically the conjectured value of cr ( K n ) . Let cr P ( G ) denote the crossing number of a graph G in the projective plane. Recently, Elkies proved that the expected number of crossings in a naturally defined random projective plane drawing of K n is ( n 4 8 π 2 ) + O ( n 3 ) . In analogy with the relation of Moon's result to Hill's conjecture, Elkies asked if lim n cr P ( K n ) n 4 = 1 8 π 2 . We construct drawings of K n in the projective plane that disprove this.

中文翻译:

投影平面上完整图形的图形

希尔的猜想指出,交叉数 ķ ñ 完整图的 ķ ñ 在平面上(相当于球体)是 1个 4 ñ 2个 ñ - 1个 2个 ñ - 2个 2个 ñ - 3 2个 = ñ 4 64 + Ø ñ 3 。Moon证明,在球面图形中,通过随机测地线将点随机分布并连接的预期交叉点数是精确的 ñ 4 64 + Ø ñ 3 ,从而渐近匹配 ķ ñ 。让 P G 表示图的交叉数 G 在投影平面上。最近,埃尔基斯(Elkies)证明,在自然定义的随机投影平面图中,预期的交叉次数 ķ ñ ñ 4 8 π 2个 + Ø ñ 3 。类似于月亮的结果与希尔的猜想的关系,埃尔基斯问 ñ P ķ ñ ñ 4 = 1个 8 π 2个 。我们绘制的图纸 ķ ñ 在投射平面上证明了这一点。
更新日期:2021-05-14
down
wechat
bug