Conceptio › Archive › arXiv (All)
arXiv (All) open access

The $\mathbb{Z}$-Divisor Graph on $\mathbb{Q} \cap [1,7]$ is Planar and 3-Colorable

Walton, Michael D. et al.
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
combinatorics
We prove that a divisor graph on an interval of integers is a planar graph whenever the interval $[n,m]$ satisfies $m\leq 7n$, and that 7 is the greatest such real number for which we can guarantee that the graph is planar. We prove these graphs are 3-colorable.
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

Record · ID 1051128
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