Pages that link to "Item:Q2557037"
From MaRDI portal
The following pages link to Distances realized by sets covering the plane (Q2557037):
Displaying 39 items.
- On a generalization of the Hadwiger-Nelson problem (Q522309) (← links)
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm (Q596065) (← links)
- Monochromatic triangles in two-colored plane (Q624214) (← links)
- The fractional chromatic number of the plane (Q722307) (← links)
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489) (← links)
- Simple product colorings (Q793736) (← links)
- On the connectedness of some geometric graphs (Q804592) (← links)
- Lifting of a bound for the chromatic number of \(\mathbb R^n\) to higher dimensions (Q845498) (← links)
- On four-colourings of the rational four-space (Q917570) (← links)
- Unit-distance graphs in rational n-spaces (Q1101133) (← links)
- Universal covers of finite sets (Q1108586) (← links)
- Every 5-coloured map in the plane contains a monochrome unit (Q1151404) (← links)
- The realization of distances in measurable subsets covering \(R^ n\). (Q1156808) (← links)
- Coloring abelian groups (Q1164049) (← links)
- Connectivity of distance graphs (Q1196753) (← links)
- A six-coloring of the plane (Q1200003) (← links)
- An 18-colouring of 3-space omitting distance one (Q1363671) (← links)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- Additive \(k\)-colorable extensions of the rational plane (Q1813726) (← links)
- Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\) (Q1813730) (← links)
- Bounds on the measurable chromatic number of \({\mathbb{R}}\) (Q1824627) (← links)
- Patch colorings and rigid colorings of the rational \(n\)-space (Q1850575) (← links)
- Strong Ramsey properties of simplices (Q1885594) (← links)
- Finite Euclidean Ramsey theory (Q1906140) (← links)
- Edge-Ramsey theory (Q1913602) (← links)
- On the connectivity of unit distance graphs (Q1923783) (← links)
- Borsuk's partition problem and finite point sets (Q1992189) (← links)
- Triangle colorings require at least seven colors (Q2032735) (← links)
- Polynomial configurations in sets of positive upper density over local fields (Q2227134) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- The odd-distance plane graph (Q2391203) (← links)
- On the chromatic number of subsets of the Euclidean plane (Q2441349) (← links)
- Clique numbers of finite unit-quadrance graphs (Q2688242) (← links)
- ORTHOGONAL COLORINGS OF THE SPHERE (Q2810736) (← links)
- The Hadwiger–Nelson Problem (Q2827299) (← links)
- On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
- (Q5384215) (← links)
- Coloring distance graphs on the plane (Q6046170) (← links)
- A triangle-free, 4-chromatic \(\mathbb{Q}^3\) Euclidean distance graph Scavenger hunt! (Q6064853) (← links)
