Pages that link to "Item:Q4580441"
From MaRDI portal
The following pages link to On the chromatic number of an infinitesimal plane layer (Q4580441):
Displaying 12 items.
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← 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)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles (Q2314097) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- On the chromatic number of random subgraphs of a certain distance graph (Q2322889) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
- Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
- Coloring distance graphs on the plane (Q6046170) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)
- On the chromatic number of 2-dimensional spheres (Q6151024) (← links)
