Year: 2025
Type: article
Abstract: In this paper we show that prime sum graphs on n vertices – which are graphs on vertex set $$\{1,2, \dots ,n\}$$ { 1 , 2 , ⋯ , n } where ij is an edge when $$i+j$$ i + j is prime – contain all trees with at most $$\exp ( c \log n / \log \log n)$$ exp ( c log n / log log n ) vertices as induced subgraphs. We also prove some results for related graphs, and end with some unsolved problems.
Source: Graphs and Combinatorics
Authors: Ernie Croot, Patrick Jin
Institution: Georgia Institute of Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,190
OpenAlex ID: W4417534557