Sets of integers with missing differences
From MaRDI portal
Publication:5905929
DOI10.1016/0097-3165(77)90076-0zbMath0359.10047OpenAlexW1989366518MaRDI QIDQ5905929
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(77)90076-0
Related Items (20)
Asymptotic clique covering ratios of distance graphs ⋮ The channel assignment problem for mutually adjacent sites ⋮ Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem ⋮ Domination ratio of a family of integer distance digraphs with arbitrary degree ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ On the density of integral sets with missing differences from sets related to arithmetic progressions ⋮ Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ On Motzkin's problem in the circle group ⋮ Fractional chromatic number of distance graphs generated by two-interval sets ⋮ On optimal \(M\)-sets related to Motzkin's problem ⋮ Sequences of integers with missing quotients ⋮ Sets of integers with missing differences ⋮ Sequences of integers with three missing separations ⋮ Density of sets with missing differences and applications ⋮ Unnamed Item ⋮ Maximal density of integral sets with missing differences and the kappa values ⋮ Distance graphs and \(T\)-coloring
Cites Work
This page was built for publication: Sets of integers with missing differences
