arXiv (All)
open access
On the Number of Almost Empty Monochromatic Triangles
In this paper, we consider the problem of counting almost empty monochromatic triangles in colored planar point sets, that is, triangles whose vertices are all assigned the same color and that contain only a few interior points. Specifically, we show that any $c$-coloring of a set of $n$ points in 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
- Proper edge colorings of planar graphs with rainbow $C_4$-s#793392
- Proper edge colorings of planar graphs with rainbow $C_4$-s#789388
- An improved lower bound for the van der Waerden number $w(3,k)$#1115754
- Bounds for B-coloring planar and outerplanar graphs#818487
- Subset selection problems in planar point sets#925735
Record · ID 999723
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