Non-planarity of Markoff graphs mod p
Matthew de Courcy-Ireland

TL;DR
This paper proves that certain graphs derived from solutions to the Markoff equation modulo large primes are non-planar, using topological and combinatorial methods, with explicit constructions for specific prime classes.
Contribution
It establishes the non-planarity of Markoff graphs mod p for large primes and specific residue classes, using Euler characteristic and cycle enumeration techniques.
Findings
Markoff graphs are non-planar for primes > 7
Explicit constructions confirm non-planarity for certain prime classes
Non-planarity linked to spectral gap assumptions
Abstract
We prove the non-planarity of a family of 3-regular graphs constructed from the solutions to the Markoff equation modulo prime numbers greater than 7. The proof uses Euler characteristic and an enumeration of the short cycles in these graphs. Non-planarity for large primes would follow assuming a spectral gap, which was the original motivation. For primes congruent to 1 modulo 4, or congruent to 1, 2, or 4 modulo 7, explicit constructions give an alternate proof of non-planarity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · Graph theory and applications
