The optimal drawings of K_{5,n}
Cesar Hernandez-Velez, Carolina Medina, Gelasio Salazar

TL;DR
This paper investigates the structure of crossing-minimal drawings of the bipartite graph K_{5,n}, revealing conditions under which optimal drawings have antipodal vertices and characterizing all such optimal configurations for even n.
Contribution
It provides new structural insights into optimal drawings of K_{5,n}, including conditions for antipodal vertices and a classification of all optimal drawings without antipodal vertices for even n.
Findings
Optimal drawings of K_{5,n} with n ≡ 2 (mod 4) have antipodal vertices.
A family of optimal drawings without antipodal vertices is characterized for n ≡ 0 (mod 4).
Every optimal drawing of K_{5,n} for even n decomposes into Zarankiewicz drawings and a specific configuration D_{r,s}.
Abstract
Zarankiewicz's Conjecture (ZC) states that the crossing number cr equals . Since Kleitman's verification of ZC for (from which ZC for easily follows), very little progress has been made around ZC; the most notable exceptions involve computer-aided results. With the aim of gaining a more profound understanding of this notoriously difficult conjecture, we investigate the optimal (that is, crossing-minimal) drawings of . The widely known natural drawings of (the so-called Zarankiewicz drawings) with crossings contain antipodal vertices, that is, pairs of degree- vertices such that their induced drawing of has no crossings. Antipodal vertices also play a major role in Kleitman's inductive proof that cr. We…
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.
