English

Prime sum graphs and the induced trees they contain

Number Theory 2023-06-08 v1 Combinatorics

Abstract

In this paper we show that prime sum graphs on nn vertices -- which are graphs on vertex set {1,2,...,n}\{1,2,...,n\} where ijij is an edge when i+ji+j is prime -- contain all trees with at most exp(clogn/loglogn)\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.

Keywords

Cite

@article{arxiv.2306.04565,
  title  = {Prime sum graphs and the induced trees they contain},
  author = {Ernie Croot and Patrick Jin},
  journal= {arXiv preprint arXiv:2306.04565},
  year   = {2023}
}

Comments

This was part of an undergrad research project that Patrick did with me last year

R2 v1 2026-06-28T10:59:03.347Z