arXiv (All)
open access
Cayley-graph density of Thompson's group F: local deletions and finite-window bounds
Let $Γ$ be the Cayley graph of Thompson's group $F$ with its standard generators. Belk and Brown constructed finite marked-forest subgraphs of limiting density $7/2$, and Guba showed that deleting certain low-degree vertices gives density greater than $3.5004$. We refine this approach in two directi
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
- The Adams conjecture#610724
- Ramsey Illustration Collection (1926) — Botanical Illustrations, NREM Dendrology Lab, Iowa State University#1042727
- A Geometric Criterion for Degeneracy in the Elekes-Szabó Theorem#998286
- Solving Vertex Integrity Faster than $2^n$#1118852
- A calculus for Belnap's logic in which each proof consists of two trees#777537
Record · ID 1011214
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