arXiv (All)
open access
Large Planar Point Sets Contain 4 Collinear Points or Almost 7-Cliques, and Related Results
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, t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sparse chromatic graphs and the complete-graph triangle bound#1062147
- Bounded chromatic number of graphs with small clique number and large minimum degree#1050283
- Four collinear points or six visible points#1035005
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
- A note on vertex-critical induced subgraphs of shift graphs#1052081
Record · ID 1062998
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive