On optimal \(M\)-sets related to Motzkin's problem

DOI10.1155/2020/7457625zbMath1484.11037OpenAlexW3117370055MaRDI QIDQ1983376

Jiandong Wu, Quan-Hui Yang, Ting Pan

Publication date: 10 September 2021

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

Full work available at URL: https://doi.org/10.1155/2020/7457625

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13)

Cites Work

• Sequences of integers with missing quotients and dense points without neighbors
• On the density of integral sets with missing differences from sets related to arithmetic progressions
• On the independence ratio of distance graphs
• Fractional chromatic number of distance graphs generated by two-interval sets
• From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
• Sequences of integers with missing quotients
• The lonely runner with seven runners
• \(T\)-colorings of graphs
• Circular chromatic numbers and fractional chromatic numbers of distance graphs
• Distance graphs and \(T\)-coloring
• \(T\)-graphs and the channel assignment problem
• Flows, view obstructions, and the lonely runner
• Sequences of integers with missing differences
• Sequences of integers with three missing separations
• Fractional chromatic number and circular chromatic number for distance graphs with large clique size
• On the Density of Integral Sets with Missing Differences
• Density of M-sets in arithmetic progression
• Sum and difference sets containing integer powers
• Sets of integers with missing differences
• Sets of integers with missing differences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On optimal \(M\)-sets related to Motzkin's problem