The 3-symmetric Pseudolinear Crossing Number of $K_{33}$
V\'ictor H. G\'omez Mart\'inez, C\'esar Hern\'andez-V\'elez, Jes\'us Lea\~nos

TL;DR
This paper proves that the 3-symmetric rectilinear and pseudolinear crossing numbers of the complete bipartite graph K_{33} are equal, both being 14,634, establishing a precise crossing number value for this graph.
Contribution
The paper establishes the equality of 3-symmetric rectilinear and pseudolinear crossing numbers for K_{33}, providing an exact crossing number value.
Findings
Both crossing numbers are equal to 14,634.
The equality of these crossing numbers is rigorously proven.
The result advances understanding of symmetric crossing numbers in graph theory.
Abstract
We show that the 3-symmetric rectilinear and the 3-symmetric pseudolinear crossing numbers of are equal. Specifically, we prove that .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Combinatorial Mathematics · Polynomial and algebraic computation
