query: Coloring $\mathbb R^3$ with 3 colors always gives us a color with all distances.
positive_passages.docid: 149104
positive_passages.text: Coloring $\mathbb R^n$ with $n$ colors always gives us a color with all distances.
negative_passages.docid: 102084
negative_passages.text: How to show path-connectedness of $GL(n,\mathbb{C})$
negative_passages.docid: 12557
negative_passages.text: Coloring Graph Problem
negative_passages.docid: 126583
negative_passages.text: Coloring points on an n-gon
negative_passages.docid: 136826
negative_passages.text: Coloring the integers with red, blue, and green
negative_passages.docid: 155295
negative_passages.text: A solution to the Four-Color Theorem applied to the map Florida, USA
negative_passages.docid: 23337
negative_passages.text: Coloring a $3\times n$ board using $3$ colors
negative_passages.docid: 42270
negative_passages.text: Combinatorics - Painting the Unit Squares of a 3x3 Square
negative_passages.docid: 65638
negative_passages.text: Proportional Coloring within polygon for multiple variables
negative_passages.docid: 129935
negative_passages.text: Coloring problem with equilateral triangles
negative_passages.docid: 110760
negative_passages.text: Chromatic Polynomial
negative_passages.docid: 47494
negative_passages.text: How to color math symbols?
negative_passages.docid: 5856
negative_passages.text: How put color in all math mode?
negative_passages.docid: 124801
negative_passages.text: Coloring arrows in \xymatrix
negative_passages.docid: 23851
negative_passages.text: Is there a set of lines in $\mathbb{R}^3$ such that their union is equal to the set of points with not all coordinates rational?
negative_passages.docid: 152478
negative_passages.text: Is there a homeomorphism between the $n$-dimensional cube to the $n$-dimensional simplex that doesn't create hard corners?
negative_passages.docid: 55944
negative_passages.text: Chromatic polynomial of connected graph $ \leq x(x-1)^{n-1}$