On dividing sets into parts of smaller diameter

DOI10.1134/S1064562420060174zbMath1477.05012OpenAlexW3134300526MaRDI QIDQ2243826

Andrei M. Raigorodskii

Publication date: 11 November 2021

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562420060174

zbMATH Keywords

partitioncoloringdiameter graphpoint sets in spaces

Mathematics Subject Classification ID

Partitions of sets (05A18) Extremal set theory (05D05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Distance in graphs (05C12)

Related Items (4)

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 ⋮ Covering planar sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
• Estimate of the number of edges in special subgraphs of a distance graph
• A generalization of Kneser graphs
• Incompatible intersection properties
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
• Degree versions of theorems on intersecting families via stability
• Ramsey theory in the -space with Chebyshev metric
• Covering a sphere with spheres

This page was built for publication: On dividing sets into parts of smaller diameter