The following pages link to On the space chromatic number (Q1849964):
Displaying 43 items.
- On the measurable chromatic number of a space of dimension \(n \leq 24\) (Q265996) (← links)
- On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
- On the chromatic number of \(\mathbb R^4\) (Q464746) (← links)
- Unit-Distance Graphs in Minkowski metric spaces (Q752724) (← links)
- Lifting of a bound for the chromatic number of \(\mathbb R^n\) to higher dimensions (Q845498) (← links)
- On embedding of finite distance graphs with large chromatic number in random graphs (Q847934) (← links)
- Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra (Q941905) (← links)
- Colorings of spaces, and random graphs (Q950800) (← links)
- Embeddability of finite distance graphs with a large chromatic number in random graphs (Q960646) (← links)
- An 18-colouring of 3-space omitting distance one (Q1363671) (← links)
- A Euclidean Ramsey problem (Q1404500) (← links)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- A result in asymmetric Euclidean Ramsey theory (Q1709554) (← links)
- Distance graphs having large chromatic numbers and containing no cliques or cycles of a given size (Q1761033) (← links)
- Axiom of choice and chromatic number of \(R^n\) (Q1775552) (← links)
- Finite Euclidean Ramsey theory (Q1906140) (← links)
- On distance subgraphs of graphs in spaces of lower dimensions (Q1948589) (← links)
- Distance graphs with large chromatic number and without large cliques (Q1957062) (← links)
- Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid (Q2042611) (← links)
- On rainbow isosceles \(n\)-simplexes (Q2161992) (← links)
- Almost-equidistant sets (Q2175803) (← links)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space (Q2309559) (← links)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) (Q2313626) (← links)
- On large subgraphs of a distance graph which have small chromatic number (Q2342369) (← links)
- On the chromatic numbers of low-dimensional spaces (Q2358584) (← links)
- On the chromatic number of a space with a forbidden regular simplex (Q2358587) (← links)
- On configurations of solid balls in 3-space: chromatic numbers and knotted cycles (Q2373432) (← links)
- On the chromatic number of \(\mathbb{R}^{9}\) (Q2451718) (← links)
- On a series of Ramsey-type problems in combinatorial geometry (Q2518810) (← links)
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres (Q2675865) (← links)
- The chromatic numbers of some Euclidean distance graphs (Q2719864) (← links)
- The Hadwiger–Nelson Problem (Q2827299) (← links)
- Chromatic numbers of hyperbolic surfaces (Q2833075) (← links)
- Small clique and large chromatic number (Q2851500) (← links)
- On the colouring of spheres embedded in $ \mathbb R^n$ (Q3173333) (← links)
- On the Chromatic Numbers of and with Intervals of Forbidden Distances (Q3503466) (← links)
- An estimate for the chromatic number of the space $ \mathbb R^4$ (Q3508695) (← links)
- On a problem of colouring the real plane (Q3985060) (← links)
- On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
- On the chromatic number of plane tilings (Q4668459) (← links)
- The chromatic number of a space with the metric $ l_q$ (Q4677496) (← links)
- Bounding the Size of an Almost-Equidistant Set in Euclidean Space (Q5219320) (← links)
- On the chromatic numbers of small-dimensional Euclidean spaces (Q5891225) (← links)
