English

The rectilinear local crossing number of $K_n$

Combinatorics 2024-05-20 v4

Abstract

We determine lcrˉ(Kn){\bar{\rm{lcr}}}(K_n), the rectilinear local crossing number of the complete graph KnK_n for every nn. More precisely, for every n{8,14},n \notin \{8, 14 \}, lcrˉ(Kn)=12(n3n33)n33, {\bar{\rm{lcr}}}(K_n)=\left\lceil \frac{1}{2} \left( n-3-\left\lceil \frac{n-3}{3} \right\rceil \right) \left\lceil \frac{n-3}{3} \right\rceil \right\rceil, lcrˉ(K8)=4{\bar{\rm{lcr}}}(K_8)=4, and lcrˉ(K14)=15{\bar{\rm{lcr}}}(K_{14})=15.

Keywords

Cite

@article{arxiv.1508.07926,
  title  = {The rectilinear local crossing number of $K_n$},
  author = {Bernardo M. Ábrego and Silvia Fernández-Merchant},
  journal= {arXiv preprint arXiv:1508.07926},
  year   = {2024}
}

Comments

Changes from v3: A few typos were corrected (ceiling symbols were missing)