Pages that link to "Item:Q2847920"
From MaRDI portal
The following pages link to Coloring Distance Graphs and Graphs of Diameters (Q2847920):
Displayed 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)
- 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)
- Turán type results for distance graphs (Q331389) (← links)
- On the distance and multidistance graph embeddability problem (Q334409) (← 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)
- 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 some Erdős-Ko-Rado type results (Q507514) (← links)
- On random subgraphs of Kneser graphs and their generalizations (Q512505) (← 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)
- 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 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)
- On the chromatic numbers of rational spaces (Q1646347) (← links)
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets (Q1646366) (← 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)
- A result in asymmetric Euclidean Ramsey theory (Q1709554) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- On a relation between packing and covering densities of convex bodies (Q2022613) (← links)
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- Coverings of planar and three-dimensional sets with subsets of smaller diameter (Q2166237) (← 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)
- On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← links)
- Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\) (Q2254100) (← links)
- One problem on geometric Ramsey numbers (Q2258893) (← 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)
- Exponentially Ramsey sets (Q2278704) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space (Q2309559) (← 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)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- Clique numbers of random subgraphs of some distance graphs (Q2314150) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
