Pages that link to "Item:Q1849913"
From MaRDI portal
The following pages link to A 15-colouring of 3-space omitting distance one (Q1849913):
Displaying 26 items.
- On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
- On the chromatic number of \(\mathbb R^4\) (Q464746) (← links)
- On embedding of finite distance graphs with large chromatic number in random graphs (Q847934) (← 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)
- 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)
- On distance subgraphs of graphs in spaces of lower dimensions (Q1948589) (← links)
- On rainbow isosceles \(n\)-simplexes (Q2161992) (← links)
- On large subgraphs of a distance graph which have small chromatic number (Q2342369) (← links)
- On configurations of solid balls in 3-space: chromatic numbers and knotted cycles (Q2373432) (← 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 Hadwiger–Nelson Problem (Q2827299) (← links)
- Small clique and large chromatic number (Q2851500) (← links)
- On the Chromatic Numbers of and with Intervals of Forbidden Distances (Q3503466) (← links)
- How different can colours be? Maximum separation of points on a spherical octant (Q4223972) (← links)
- On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
- On the chromatic number of plane tilings (Q4668459) (← links)
- Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
- On the chromatic numbers of small-dimensional Euclidean spaces (Q5891225) (← links)
- On the chromatic number of 2-dimensional spheres (Q6151024) (← links)
- Upper bounds on chromatic number of \(\mathbb{E}^n\) in low dimensions (Q6574374) (← links)
