On optimal M-sets related to Motzkin's problem
From MaRDI portal
Publication:1983376
Summary: Let \(M\) be a set of positive integers. A set \(S\) of nonnegative integers is called an \(M\)-set if \(a\) and \(b\in S\), then \(a-b\notin M\). If \(S\subseteq\{ 0, 1, \dots, n\}\) is an \(M\)-set with the maximal cardinality, then \(S\) is called a maximal \(M\)-set of \(\{0, 1, \dots, n\}\). If \(S\cap\{0, 1, \dots, n\}\) is a maximal \(M\)-set of \(\{0, 1, \dots, n\}\) for all integers \(n\geq0\), then we call \(S\) an optimal \(M\)-set. In this paper, we study the existence of an optimal \(M\)-set.
Recommendations
- scientific article; zbMATH DE number 59441
- scientific article; zbMATH DE number 4128841
- A result on sets, with applications to vector optimization
- Some equivalent problems in set optimization
- Motzkin type alternative theorem and set-valued optimization
- scientific article; zbMATH DE number 4183334
- Extremal problems on set systems
- On (n,m)-convex sets
- An extremal problem for sets: A new approach via Bezoutians
- scientific article; zbMATH DE number 7326969
Cites work
- \(T\)-colorings of graphs
- \(T\)-graphs and the channel assignment problem
- A note on the density of M-sets in geometric sequence.
- Circular chromatic numbers and fractional chromatic numbers of distance graphs
- Circular chromatic numbers and fractional chromatic numbers of distance graphs with distance sets missing an interval.
- Density of M-sets in arithmetic progression
- Distance graphs and \(T\)-coloring
- Flows, view obstructions, and the lonely runner
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- 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
- scientific article; zbMATH DE number 1275588 (Why is no real title available?)
- scientific article; zbMATH DE number 1792623 (Why is no real title available?)
- Note on a problem of Motzkin regarding density of integral sets with missing differences
- On the density of integral sets with missing differences from sets related to arithmetic progressions
- On the independence ratio of distance graphs
- Sequences of integers with missing differences
- Sequences of integers with missing quotients
- Sequences of integers with missing quotients and dense points without neighbors
- Sequences of integers with three missing separations
- Sets of integers with missing differences
- Sets of integers with missing differences
- Sum and difference sets containing integer powers.
- The lonely runner with seven runners
This page was built for publication: On optimal \(M\)-sets related to Motzkin's problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983376)
