Integer sets with prescribed pairwise differences being distinct

DOI10.1016/j.ejc.2004.04.008zbMath1062.05126OpenAlexW2014323465MaRDI QIDQ1775027

Oleg Pikhurko, Béla Bollobás

Publication date: 4 May 2005

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.04.008

zbMATH Keywords

difference-magic labeling

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Minimum-weight edge discriminators in hypergraphs, Sum-distinguishing number of sparse hypergraphs, Largest cliques in connected supermagic graphs, On sets of integers with restrictions on their products, Approximate results for rainbow labelings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sums of a Sidon-sequence
• Dense edge-magic graphs and thin additive bases
• Weighted sums of certain dependent random variables
• A Survey of Problems in Combinatorial Number Theory
• Distance Graphs on the Integers
• Probability Inequalities for Sums of Bounded Random Variables
• On the existence of a factor of degree one of a connected random graph
• The Factorization of Linear Graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems