Dense Edge-Magic Graphs and Thin Additive Bases

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
19 pages; 4 figures

Keywords

Combinatorics, Number Theory, 05C78; 11B75

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/68437

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0309029
 http://arxiv.org/abs/math/0309029

Collections

arXiv