Dense Edge-Magic Graphs and Thin Additive Bases
Combinatorics
2007-05-23 v1 Number Theory
Abstract
We study s(k,n), the maximum size of A+A where A is a k-subset of [n]. A few known functions from additive number theory can be expressed via s(k,n). For example, our estimates of s(k,n) imply new bounds on the maximum size of quasi-Sidon sets, a problem posed by Erdos and Freud [J. Number Th.38 (1991) 196-205]. Also, applications to so-called edge-magic labellings of graphs are given.
Cite
@article{arxiv.math/0309029,
title = {Dense Edge-Magic Graphs and Thin Additive Bases},
author = {Oleg Pikhurko},
journal= {arXiv preprint arXiv:math/0309029},
year = {2007}
}
Comments
19 pages; 4 figures