arXiv (All)
open access
Tight bounds on the Carathéodory and exchange numbers in $\triangle$-convexity
The $\triangle$-convexity space on a finite, simple graph $G = (V,E)$ is the collection $\mathcal{C}$ of subsets $S \subseteq V(G)$ such that whenever $x \in V(G)$ forms a triangle with two vertices in $S$, we have $x \in S$. The members of $\mathcal{C}$ are called convex sets, and the convex hull o
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
- 4-Arc-Pancyclicity of Regular Multipartite Tournaments#1000326
- Shared Agency and Mutual Obligations: A Pluralist Account#118480
- Contextualized Functions: Possible Tensions In Stecker’s Definition#764282
- Caminos y huellas de las maternidades y sexualidades: hacia una reflexión de la etnografía del hacer#453209
- Wrestling with the Eleatics in Plato's Parmenides#762881
Record · ID 1128711
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