On the Simple Quasi Crossing Number of $K_{11}$

TL;DR

This paper determines that the simple quasi crossing number of the complete graph with 11 vertices is exactly 4, providing a precise measure of its minimal crossing complexity.

Contribution

The paper establishes the exact simple quasi crossing number for $K_{11}$, a previously unresolved problem in graph drawing.

Findings

The simple quasi crossing number of $K_{11}$ is 4.

Provides a new exact value for a specific graph's crossing number.

Advances understanding of crossing numbers in graph theory.

Abstract

We show that the simple quasi crossing number of $K_{11}$ is $4$.