Pages that link to "Item:Q2784519"
From MaRDI portal
The following pages link to Borsuk's problem and the chromatic numbers of some metric spaces (Q2784519):
Displaying 50 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- On the measurable chromatic number of a space of dimension \(n \leq 24\) (Q265996) (← links)
- On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
- On the chromatic numbers of integer and rational lattices (Q289743) (← links)
- Independence numbers of random subgraphs of a distance graph (Q296011) (← links)
- Estimate for the chromatic number of Euclidean space with several forbidden distances (Q325532) (← 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)
- New bounds for the distance Ramsey number (Q393923) (← links)
- On Schur's conjecture in \(\mathbb{R}^{4}\) (Q403945) (← 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)
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs (Q483670) (← links)
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (Q492207) (← links)
- On the stability of the Erdös-Ko-Rado theorem (Q498190) (← links)
- Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm (Q596065) (← links)
- On the chromatic number of with an arbitrary norm (Q626862) (← links)
- Lower bound for the chromatic number of a rational space with metric \(l_u\) and with one forbidden distance (Q679870) (← links)
- The chromatic number of space with forbidden regular simplex (Q679877) (← links)
- An exact result for \((0, \pm 1)\)-vectors (Q723491) (← links)
- Diameter graphs in \({\mathbb R}^4\) (Q741607) (← 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)
- On embedding of finite distance graphs with large chromatic number in random graphs (Q847934) (← links)
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713) (← links)
- On threshold probabilities for the realization of a random graph by a geometric graph (Q892733) (← links)
- On lower bounds for the chromatic number of sphere (Q892738) (← links)
- Colorings of spaces, and random graphs (Q950800) (← links)
- New sets with large Borsuk numbers (Q1406552) (← links)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets (Q1646366) (← links)
- Chromatic number with several forbidden distances in the space with the \(\ell_q\)-metric (Q1687983) (← links)
- Diameters of random distance graphs (Q1687985) (← links)
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors (Q1689038) (← links)
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- Distance graphs with large chromatic numbers and small clique numbers (Q1761033) (← links)
- The Borsuk partition problem: the seventieth anniversary (Q1777522) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Strong Ramsey properties of simplices (Q1885594) (← links)
- Gigantic component in random distance graphs of special form (Q1929782) (← links)
- On the probability of the occurrence of a copy of a fixed graph in a random distance graph (Q1946441) (← links)
- Chromatic numbers of spaces with forbidden monochromatic triangles (Q1947779) (← links)
- On distance subgraphs of graphs in spaces of lower dimensions (Q1948589) (← links)
- Tree components in random distance graphs of special form (Q1948591) (← links)
- Distance graphs with large chromatic number and without large cliques (Q1957062) (← 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)
