Dense Edge-Magic Graphs and Thin Additive Bases
| dc.creator | Pikhurko, Oleg | |
| dc.date | 2003-09-02 | |
| dc.date.accessioned | 2026-07-07T05:00:45Z | |
| dc.date.available | 2026-07-07T05:00:45Z | |
| dc.description | 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. | |
| dc.description | 19 pages; 4 figures | |
| dc.identifier | https://arxiv.org/abs/math/0309029 | |
| dc.identifier | http://arxiv.org/abs/math/0309029 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/68437 | |
| dc.subject | Combinatorics | |
| dc.subject | Number Theory | |
| dc.subject | 05C78; 11B75 | |
| dc.title | Dense Edge-Magic Graphs and Thin Additive Bases | |
| dc.type | text |