Dense edge-magic graphs and thin additive bases
From MaRDI portal
Publication:2501547
DOI10.1016/J.DISC.2006.05.003zbMATH Open1102.05052arXivmath/0309029OpenAlexW2004782359MaRDI QIDQ2501547FDOQ2501547
Publication date: 14 September 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0309029
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Other combinatorial number theory (11B75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theorems in the additive theory of numbers
- The number of squares and \(B_h[g]\) sets
- Magic Valuations of Finite Graphs
- A Survey of Problems in Combinatorial Number Theory
- On the representation of 1,2,..., n by sums
- Untere Schranken für die Reichweiten von Extremalbasen fester Ordnung
- On sums of a Sidon-sequence
- Upper and lower bounds for finite \(B_h[g]\) sequences.
- Eine obere Schranke für die Reichweite einer Extremalbasis zweiter Ordnung.
- Well distribution of Sidon sets in residue classes
- On a question by Erdős about edge-magic graphs
- On the Cardinality of h -Bases for n
Cited In (3)
This page was built for publication: Dense edge-magic graphs and thin additive bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501547)
