Pages that link to "Item:Q452856"
From MaRDI portal
The following pages link to On the chromatic numbers of spheres in \(\mathbb R^n\) (Q452856):
Displaying 40 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)
- New bounds for the chromatic number of a space with forbidden isosceles triangles (Q471374) (← links)
- Realization of subgraphs of random graphs by graphs of diameters in Euclidean spaces (Q471395) (← links)
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections (Q483655) (← links)
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs (Q483670) (← links)
- On the stability of some Erdős-Ko-Rado type results (Q507514) (← links)
- On the realization of subgraphs of a random graph by diameter graphs in Euclidean spaces (Q745606) (← links)
- Hamiltonian paths in distance graphs (Q745636) (← links)
- Strongly self-dual polytopes and distance graphs in the unit sphere (Q822619) (← links)
- On lower bounds for the chromatic number of sphere (Q892738) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- A generalization of Kneser graphs (Q2191979) (← 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)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles (Q2314097) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← 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)
- On large subgraphs of a distance graph which have small chromatic number (Q2342369) (← links)
- New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← links)
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles (Q2356524) (← links)
- On computational complexity of length embeddability of graphs (Q2629266) (← links)
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres (Q2675865) (← links)
- ORTHOGONAL COLORINGS OF THE SPHERE (Q2810736) (← links)
- Small Subgraphs in Random Distance Graphs (Q2821762) (← links)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs (Q3466410) (← links)
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (Q5396969) (← links)
- Interview with Andrei Raigorodskii (Q6097078) (← links)
- On the chromatic number of 2-dimensional spheres (Q6151024) (← links)
