Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., 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.
@article{arxiv.2410.20120,
title = {On Diophantine graphs},
author = {Gergő Batta and Lajos Hajdu and András Pongrácz},
journal= {arXiv preprint arXiv:2410.20120},
year = {2024}
}