Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
From MaRDI portal
(Redirected from Publication:5889217)
Recommendations
Cites work
- All finite sets are Ramsey in the maximum norm
- An Asymptotic Approach to the Channel Assignment Problem
- Complements of finite sets of integers
- Covering and packing in \({\mathbb Z}^n\) and \({\mathbb R}^n\). I
- Covering and packing in \({\mathbb Z^n}\) and \({\mathbb R^n}\). II
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- Notes on the Representation of 1,2, ……, N by differences
- On a Problem of Additive Number Theory
- On covering by translates of a set
- Periodicity and decidability of tilings of \(\mathbb{Z}^2\)
- Polychromatic colorings on the integers
- Research Problems in Discrete Geometry
- Some covering and packing results in number theory
- Some Results on Additive Number Theory
- Tesselation of integers
- Tiling the integers with translates of one finite set
- Tiling, packing, and covering by clusters
Cited in
(8)- The solution of a conjecture of Stanley and Wilf for all layered patterns
- On \(k^+\)-neighbour packings and one-sided Hadwiger configurations
- scientific article; zbMATH DE number 493080 (Why is no real title available?)
- Max-norm Ramsey theory
- On the chromatic number of slices without monochromatic unit arithmetic progressions
- Tilings of \(\mathbb{Z}\) with multisets of distances
- Packing density of sets with only two nonmixed gaps
- Dissociation in circulant graphs and integer distance graphs
This page was built for publication: Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889217)
