On Diophantine graphs
Authors:
- 22 May 2025
- journal article
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 111 (5)
Abstract
Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper, we study Diophantine graphs, that is, finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only if their product increased by one is a square. We provide various results for Diophantine graphs, including extendability properties, lower‐ and upper bounds for the maximum number of edges and chromatic numbers.Keywords
All Related Versions
Funding Information
- Nemzeti Kutatási Fejlesztési és Innovációs Hivatal (128088, 130909, KKP 138270)
This publication has 25 references indexed in Scilit:
- Diophantine m-tuples and Elliptic Curves2024
- There is no Diophantine quintupleTransactions of the American Mathematical Society, 2018
- The regularity of Diophantine quadruplesTransactions of the American Mathematical Society, 2017
- Large Networks and Graph Limits2012
- On the number of Diophantine m-tuplesThe Ramanujan Journal, 2007
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- The canonical height and integral points on elliptic curvesInventiones Mathematicae, 1988
- The chromatic number of random graphsCombinatorica, 1988
- Bounds for the solutions of the hyperelliptic equationMathematical Proceedings of the Cambridge Philosophical Society, 1969
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2The Quarterly Journal of Mathematics, 1969