Dense Edge-Magic Graphs and Thin Additive Bases

Details Dense Edge-Magic Graphs and Thin Additive Bases Dense Edge-Magic Graphs and Thin Additive Bases

2003-09-02

arxiv.org/abs/math/0309029v1

Mathematics

Combinatorics

19 pages; 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dense Edge-Magic Graphs and Thin Additive Bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dense Edge-Magic Graphs and Thin Additive Bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dense Edge-Magic Graphs and Thin Additive Bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-493666