arXiv (All)
open access
Almost Empty Monochromatic Polygons in Planar Point Sets
For integers $r \ge 3$, $c \ge 2$, and $s \ge 0$, let $\mathsf{M}_r^{\star}(c,s)$ denote the smallest integer such that any set of at least $\mathsf{M}_r^{\star}(c,s)$ points in the plane in general position (no three on a line), colored with $c$ colors, contains a monochromatic $r$-gon (not necessa
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
- On Colorful Kruskal--Katona Theorems#1157513
- 4-Arc-Pancyclicity of Regular Multipartite Tournaments#1000326
- A Pre-formal Proof of Why No Planar Map Needs More Than Four Colours#116629
- Covering Planar Lattices with Interior-Disjoint Unit Disks#1356133
- A volume formula for Reuleaux polyhedra#1117300
Record · ID 1388487
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