Metraipolis › archive › dc_ee91ec10f88a

Larger Crossing Families — arXiv:2610.38658

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38658
License (as archived)
CC0-1.0
Archived
2026-11-01T02:37:45.203Z
SHA-256 of the archived text
cf5579f3641985c2ff23521619f7bb33014ef395f806c19ad9971e8d47292637
Stable URL of this page
https://metraipolis.com/documento/dc_ee91ec10f88a

How to cite

Larger Crossing Families — arXiv:2610.38658 — arXiv (en), https://arxiv.org/abs/2610.38658 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ee91ec10f88a (Metraipolis archive dc_ee91ec10f88a, sha256 cf5579f3641985c2ff23521619f7bb33014ef395f806c19ad9971e8d47292637)
BibTeX
@misc{dcee91ec10f88a,
  title = {Larger Crossing Families — arXiv:2610.38658},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38658},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ee91ec10f88a; sha256 cf5579f3641985c2ff23521619f7bb33014ef395f806c19ad9971e8d47292637},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38658. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give the first explicit constant for crossing families of linear size by showing that every set of $n$ points in general position in the plane contains a crossing family of size approximately $\frac{n}{79}$. We further identify some conditions where there are even larger crossing families. The first such condition forbids the existence of a large different pattern, namely non-convex 4-clusters: We show that every point set contains either a large non-convex 4-cluster or a large crossing family. The second condition is the existence of many crossings: We give a bound for the size of a crossing family in terms of the number of crossings of the complete geometric graph drawn on the point set.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Computational Geometry (cs.CG).
Pagina del lavoro: https://arxiv.org/abs/2610.38658 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:28.256Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).