Sequences of integers with three missing separations
From MaRDI portal
Publication:2297912
DOI10.1016/j.ejc.2019.103056zbMath1433.05102arXiv1611.03940OpenAlexW2993125366WikidataQ126646036 ScholiaQ126646036MaRDI QIDQ2297912
Grant Robinson, Daphne Der-Fen Liu
Publication date: 20 February 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03940
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Special sequences and polynomials (11B83)
Related Items
Maximal density of sets with missing differences and various coloring parameters of distance graphs, Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\), Max-norm Ramsey theory, On Motzkin's problem in the circle group, On optimal \(M\)-sets related to Motzkin's problem, Maximal density of integral sets with missing differences and the kappa values
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the density of integral sets with missing differences from sets related to arithmetic progressions
- On the independence ratio of distance graphs
- Colouring the real line
- 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
- The lonely runner with seven runners
- View-obstruction problems. III
- Pattern periodic coloring of distance graphs
- The channel assignment problem for mutually adjacent sites
- Flows, view obstructions, and the lonely runner
- Sequences of integers with missing differences
- Coloring of integer distance graphs
- Circular chromatic numbers of a class of distance graphs
- View-obstruction problems in \(n\)-dimensional geometry
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- Coloring of distance graphs with intervals as distance sets
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- An Asymptotic Approach to the Channel Assignment Problem
- Integral distance graphs
- Star Extremal Circulant Graphs
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Sets of integers with missing differences
- Sets of integers with missing differences
- Six lonely runners
