Pages that link to "Item:Q5891225"
From MaRDI portal
The following pages link to On the chromatic numbers of small-dimensional Euclidean spaces (Q5891225):
Displaying 29 items.
- On the chromatic numbers of some distance graphs (Q1709876) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- Chromatic numbers of some distance graphs (Q2191956) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← links)
- Exponentially Ramsey sets (Q2278704) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2304365) (← links)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space (Q2309559) (← links)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- On lower bounds for the chromatic number of spheres (Q2313602) (← links)
- Clique chromatic numbers of intersection graphs (Q2313617) (← 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 the chromatic number of random subgraphs of a certain distance graph (Q2322889) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres (Q2675865) (← links)
- On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
- All finite sets are Ramsey in the maximum norm (Q5011684) (← links)
- On the chromatic numbers of small-dimensional Euclidean spaces (Q5891225) (← links)
- (Q5916055) (redirect page) (← links)
- Coloring distance graphs on the plane (Q6046170) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
