arXiv (All)
open access
Hadwiger--Nelson Problem for Typical Norms
The classical Hadwiger-Nelson problem asks for the chromatic number of the unit distance graph of the Euclidean plane. Over the years, this problem has been considered for a variety of other normed spaces, with higher-dimensional Euclidean space $\mathbb{R}^d$ being perhaps the most natural and well
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
- Counting $t$-wise $L$-intersecting cliques with prescribed intersection sizes#1037076
- Primal and dual characterizations of sign-symmetric norms#177055
- Pencils of norm form equations and a conjecture of Thomas, II#996795
- An improved lower bound for the blowup defective chromatic separation constant#1011291
- Toleration and the design of norms#734284
Record · ID 1131062
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