Density of sets with missing differences and applications
From MaRDI portal
Publication:2054653
DOI10.1515/ms-2021-0006zbMath1484.11030OpenAlexW3173534224MaRDI QIDQ2054653
Publication date: 3 December 2021
Published in: Mathematica Slovaca (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/ms-2021-0006
circular chromatic numberfractional chromatic numberDiophantine approximationdistance graphasymptotic density
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Density, gaps, topology (11B05)
Related Items (1)
Cites Work
- On the density of integral sets with missing differences from sets related to arithmetic progressions
- 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 channel assignment problem for mutually adjacent sites
- Sequences of integers with missing differences
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- View-obstruction problems in \(n\)-dimensional geometry
- Distance graphs with maximum chromatic number
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
- Some remarks on the lonely runner conjecture
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- An Asymptotic Approach to the Channel Assignment Problem
- Density of M-sets in arithmetic progression
- Motzkin’s Maximal Density and Related Chromatic Numbers
- Sets of integers with missing differences
- Sets of integers with missing differences
- Circular chromatic number: A survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Density of sets with missing differences and applications
