Pages that link to "Item:Q3646309"
From MaRDI portal
The following pages link to Estimating the chromatic numbers of Euclidean space by convex minimization methods (Q3646309):
Displaying 13 items.
- 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 the chromatic number of with an arbitrary norm (Q626862) (← links)
- Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric (Q1687983) (← links)
- Distance graphs with large chromatic numbers and small clique numbers (Q1761033) (← links)
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size (Q2190920) (← 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 lower bound for the chromatic number of a rational space with one and two forbidden distances (Q2353733) (← links)
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles (Q2356524) (← links)
- The chromatic number of the space $( {\mathbb R}^n, l_1)$ (Q4645149) (← links)
- Zero-one laws for random graphs with vertices in a Boolean cube (Q5269177) (← links)
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (Q5396969) (← links)
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances (Q6048774) (← links)
