期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Contribution to Guy's Conjecture
1
作者 Yukio MATSUMOTO Yoshikazu MATSUTANI +3 位作者 Angel MONTESINOS-AMILIBIA Masami ODA Shuichi OHKI tsuyoshi sakai 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2022年第10期1856-1886,共31页
Let Kdenote the complete graph consisting of n vertices,every pair of which forms an edge.We want to know the least possible number of the intersections,when we draw the graph Kon the plane or on the sphere using cont... Let Kdenote the complete graph consisting of n vertices,every pair of which forms an edge.We want to know the least possible number of the intersections,when we draw the graph Kon the plane or on the sphere using continuous arcs for edges.In a paper published in 1960,Richard K.Guy conjectured that the least possible number of the intersections is 1/64(n-1)^(2)(n-3)^(2) if n is odd,or 1/64 n(n-2)^(2)(n-4)if n is even.A virgin road V_(n)is a drawing of a Hamiltonian cycle in Kconsisting of n vertices and n edges such that no other edge-representing arcs cross V.A drawing of Kis called virginal if it contains a virgin road.All drawings considered in this paper will be virginal with respect to a fixed virgin road V.We will present a certain drawing of a subgraph of K,for each n(≥5),which is"characteristic"in the sense that any minimal virginal drawing of Kcontaining this subdrawing satisfies Guy’s conjecture. 展开更多
关键词 Complete graph virginal drawing Guy’s conjecture
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部