2007/05/25 by Jason Lucier, Lucier, Jason · 3 citations
Computer Science · Mathematics · #11B83 #11P55 #FOS: Mathematics #Finite Group Theory Research #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Number Theory (math.NT) #math.NT #msc:11B83 #msc:11P55
paper · pdf · doi:10.48550/arxiv.0705.3749
22 pages
arxiv created 2007/05/25 · openalex publication_date 2007/05/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that if A is a subset of 1, ..., n such that it has no pairs of elements whose difference is equal to p-1 with p a prime number, then the size of A is O(n(loglog n)^(-clogloglogloglog n)) for some positive constant c.