On dividing sets into parts of smaller diameter
From MaRDI portal
Publication:2243826
Cites work
- A generalization of Kneser graphs
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Covering a sphere with spheres
- Degree versions of theorems on intersecting families via stability
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Estimate of the number of edges in special subgraphs of a distance graph
- scientific article; zbMATH DE number 6381834 (Why is no real title available?)
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 177380 (Why is no real title available?)
- Incompatible intersection properties
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Ramsey theory in the \(n\)-space with Chebyshev metric
- The complete intersection theorem for systems of finite sets
Cited in
(9)- Partition bounded sets into sets having smaller diameters
- On Ramsey numbers for arbitrary sequences of graphs
- Coverings of planar and three-dimensional sets with subsets of smaller diameter
- Estimate of the number of edges in subgraphs of a Johnson graph
- scientific article; zbMATH DE number 2070003 (Why is no real title available?)
- Covering planar sets
- Block partitions: an extended view
- Optimal partitions of the flat torus into parts of smaller diameter
- On upper bounds for the number of parts in the problem of partitioning sets into parts of smaller diameter
This page was built for publication: On dividing sets into parts of smaller diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243826)
