Pages that link to "Item:Q2540988"

The following pages link to Realization of all distances in a decomposition of the space \(R^ n\) into \(n+1\) parts (Q2540988):

Displaying 13 items.

• Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
• On the chromatic numbers of integer and rational lattices (Q289743) (← links)
• A six-coloring of the plane (Q1200003) (← links)
• An 18-colouring of 3-space omitting distance one (Q1363671) (← links)
• Bounds on the measurable chromatic number of \({\mathbb{R}}\) (Q1824627) (← links)
• Another six-coloring of the plane (Q1916136) (← links)
• Borsuk's partition problem and finite point sets (Q1992189) (← links)
• A contribution to the Aleksandrov conservative distance problem in two dimensions (Q2350010) (← links)
• Distances realized by sets covering the plane (Q2557037) (← links)
• On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
• The chromatic number of the space $( {\mathbb R}^n, l_1)$ (Q4645149) (← links)
• On the chromatic number of plane tilings (Q4668459) (← links)
• The realization of distances within sets in Euclidean space (Q5658113) (← links)