Pages that link to "Item:Q610564"
From MaRDI portal
The following pages link to On the chromatic numbers of spheres in Euclidean spaces (Q610564):
Displaying 35 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- Lovász' theorem on the chromatic number of spheres revisited (Q276666) (← links)
- Independence numbers of random subgraphs of a distance graph (Q296011) (← links)
- On the number of edges in induced subgraphs of a special distance graph (Q325666) (← links)
- Independence numbers of random subgraphs of distance graphs (Q325669) (← links)
- A new estimate for the number of edges in induced subgraphs of a special distance graph (Q327309) (← links)
- On the distance and multidistance graph embeddability problem (Q334409) (← links)
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges (Q403932) (← links)
- On the chromatic numbers of spheres in \(\mathbb R^n\) (Q452856) (← links)
- New bounds for the chromatic number of a space with forbidden isosceles triangles (Q471374) (← links)
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections (Q483655) (← links)
- On combinatorial properties of spheres in euclidean spaces (Q762171) (← links)
- On lower bounds for the chromatic number of sphere (Q892738) (← links)
- Note on decomposition of spheres in Hilbert spaces (Q1082349) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- On the space chromatic number (Q1849964) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections (Q2262987) (← links)
- Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\) (Q2262992) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- On lower bounds for the chromatic number of spheres (Q2313602) (← links)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) (Q2313626) (← links)
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs (Q2342346) (← links)
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles (Q2356524) (← links)
- On configurations of solid balls in 3-space: chromatic numbers and knotted cycles (Q2373432) (← links)
- Chromatic numbers of metric spaces (Q2519262) (← links)
- On computational complexity of length embeddability of graphs (Q2629266) (← links)
- Coloring regions on a sphere to forbid the unit distance (Q2825825) (← links)
- The distinguishing chromatic numbers of triangulations on the sphere (Q2906184) (← links)
- On the colouring of spheres embedded in $ \mathbb R^n$ (Q3173333) (← links)
- An estimate for the chromatic number of the space $ \mathbb R^4$ (Q3508695) (← links)
- Chromatic numbers of real and rational spaces with real or rational forbidden distances (Q3600826) (← links)
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (Q5396969) (← links)
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs (Q6494808) (← links)
