arXiv (All)
open access
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
Can one construct a graph $G$ on the set of integer points ${\mathbb Z}^2$ in the plane such that the length of the shortest path between any two vertices of $G$ differs from their Euclidean distance by at most an absolute constant? This question of Benjamini, Erd\H os, Kleiner, Kozma, Schramm, and
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
- Packing Tails of Reciprocal Rectangles into Squares of Equal Area#1076447
- A Counterexample to Teschner's Bondage-Number Conjecture#927557
- A counterexample to Nagamochi's scoring lemma and a new rectangle packing bound#1141732
- On the Nazarov--Shcheglova Conjecture for Sharp Sobolev Inequalities: The Case (n,p)=(3,2)#1128782
- Dimer model and random lattice permutations with general weights#1077598
Record · ID 1034501
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