The optimal drawings of K_{5,n}
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 explore in depth the role of antipodal vertices in optimal drawings of , for even. We prove that if { (mod 4)}, then every optimal drawing of has antipodal vertices. We also exhibit a two-parameter family of optimal drawings of (for ), with no antipodal vertices, and show that if (mod 4), then every optimal drawing of without antipodal vertices is (vertex rotation) isomorphic to for some integers . As a corollary, we show that if is even, then every optimal drawing of is the superimposition of Zarankiewicz drawings with a drawing isomorphic to for some nonnegative integers .
Keywords
Cite
@article{arxiv.1210.1988,
title = {The optimal drawings of K_{5,n}},
author = {Cesar Hernandez-Velez and Carolina Medina and Gelasio Salazar},
journal= {arXiv preprint arXiv:1210.1988},
year = {2019}
}
Comments
In the previous version the bibliography was missing. Otherwise this is identical as Version 1