Metraipolis › archive › dc_7f82128ce077

Large Planar Point Sets Contain 4 Collinear Points or Almost 7-Cliques, and Related Results — arXiv:2609.25727

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25727
License (as archived)
CC0-1.0
Archived
2026-10-08T15:55:54.893Z
SHA-256 of the archived text
32d4cfb6799dc6449f19b413237c242aba425e97a9c78b752aad317f27c31166
Stable URL of this page
https://metraipolis.com/documento/dc_7f82128ce077

How to cite

Large Planar Point Sets Contain 4 Collinear Points or Almost 7-Cliques, and Related Results — arXiv:2609.25727 — arXiv (en), https://arxiv.org/abs/2609.25727 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7f82128ce077 (Metraipolis archive dc_7f82128ce077, sha256 32d4cfb6799dc6449f19b413237c242aba425e97a9c78b752aad317f27c31166)
BibTeX
@misc{dc7f82128ce077,
  title = {Large Planar Point Sets Contain 4 Collinear Points or Almost 7-Cliques, and Related Results — arXiv:2609.25727},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25727},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7f82128ce077; sha256 32d4cfb6799dc6449f19b413237c242aba425e97a9c78b752aad317f27c31166},
  year = {2026}
}

Archived text

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

We prove that every sufficiently large finite planar point set contains either four collinear points or seven points with at most one non-visible pair. More generally, we show that for every fixed graph $H$ with chromatic number at most five, or with chromatic number six and a color-critical edge, the visibility graph of every sufficiently large finite planar point set with no four collinear points contains a copy of $H$. These results extend the recent breakthrough of Bonnet (2026), guaranteeing six pairwise visible points, and come within one visibility edge of the next open case of the big-line-big-clique conjecture.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Computational Geometry (cs.CG).
Pagina del lavoro: https://arxiv.org/abs/2609.25727 — 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-10-08T15:16:21.679Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).