Dense edge-magic graphs and thin additive bases

DOI10.1016/j.disc.2006.05.003zbMath1102.05052arXivmath/0309029OpenAlexW2004782359MaRDI QIDQ2501547

Oleg Pikhurko

Publication date: 14 September 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0309029

zbMATH Keywords

Sidon setsum-setquasi-Sidon set

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Integer sets with prescribed pairwise differences being distinct ⋮ On \(k\)-minimum and \(m\)-minimum edge-magic injections of graphs ⋮ A new upper bound for finite additive \(h\)-bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sums of a Sidon-sequence
• Theorems in the additive theory of numbers
• Untere Schranken für die Reichweiten von Extremalbasen fester Ordnung
• Well distribution of Sidon sets in residue classes
• On a question by Erdős about edge-magic graphs
• Upper and lower bounds for finite \(B_h[g\) sequences.]
• The number of squares and B_h[g sets]
• On the representation of 1,2,..., n by sums
• A Survey of Problems in Combinatorial Number Theory
• Eine obere Schranke für die Reichweite einer Extremalbasis zweiter Ordnung.
• On the Cardinality of h -Bases for n
• Magic Valuations of Finite Graphs

This page was built for publication: Dense edge-magic graphs and thin additive bases