The 3-symmetric pseudolinear crossing number of K 36

Omar de Avila-Martínez,Jesús Leaños, Carolina Medina

Discrete Mathematics(2024)

引用 0|浏览0
暂无评分
摘要
Let n be a positive integer multiple of 3. A rectilinear drawing of the complete graph K n in the plane is 3–symmetric if its underlying point set P is 3 –symmetric , that is, if P is the disjoint union of three equal sized sets Q , ρ ( Q ) and ρ 2 ( Q ) such that ρ is a 2 π / 3 clockwise rotation around a suitable point in the plane. The 3 –symmetric rectilinear crossing number sym − cr 3 ‾ ( K n ) of K n is the minimum number of crossings in any 3–symmetric rectilinear drawing of K n. In this paper, we extend these notions to the more general setting of pseudolinear drawings of K n by defining the corresponding 3 –symmetric pseudolinear crossing number sym − cr 3 ˜ ( K n ) of K n, and show that sym − cr 3 ˜ ( K 36 ) = sym − cr 3 ‾ ( K 36 ) = 21174.
更多
查看译文
关键词
Complete graph,Geometric crossing number,Pseudolinear crossing number,m-symmetric drawings
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要