arXiv (All)
open access
Subset selection problems in planar point sets
Given a finite point set satisfying condition $\mathcal{A}$, the subset selection problem asks, how large of a subset satisfying condition $\mathcal{B}$ can be extracted? In this paper, we make progress on three instances of subset selection problems in planar point sets. Let $n,s\in\mathbb{N}$ with
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
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
- Entropy bounds and global couplings for union-closed families#985661
- On the Number of Almost Empty Monochromatic Triangles#999723
- Polychromatic Partitions, Kingman Theory, and Ewens Sampling Formula#793367
Record · ID 925735
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