Pages that link to "Item:Q4515856"
From MaRDI portal
The following pages link to On the chromatic number of a space (Q4515856):
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)
- 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)
- On the chromatic number of \(\mathbb R^4\) (Q464746) (← links)
- New bounds for the chromatic number of a space with forbidden isosceles triangles (Q471374) (← 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)
- 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 lower bounds for the chromatic number of sphere (Q892738) (← links)
- Colorings of spaces, and random graphs (Q950800) (← links)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- On a bound in extremal combinatorics (Q1643771) (← 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)
- On a Frankl-Rödl theorem and its geometric corollaries (Q1690051) (← links)
- A result in asymmetric Euclidean Ramsey theory (Q1709554) (← links)
- On the chromatic numbers of some distance graphs (Q1709876) (← links)
- Lines in Euclidean Ramsey theory (Q1739207) (← links)
- Distance graphs with large chromatic numbers and small clique numbers (Q1761033) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- Strong Ramsey properties of simplices (Q1885594) (← links)
- Chromatic numbers of spaces with forbidden monochromatic triangles (Q1947779) (← links)
- Distance graphs with large chromatic number and without large cliques (Q1957062) (← links)
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size (Q2190920) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← links)
- Polynomial configurations in sets of positive upper density over local fields (Q2227134) (← 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)
- Exponentially Ramsey sets (Q2278704) (← 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)
- Lower bounds for the measurable chromatic number of the hyperbolic plane (Q2316800) (← 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)
- On the chromatic number of Euclidean space with two forbidden distances (Q2343924) (← links)
- The density of sets avoiding distance 1 in Euclidean space (Q2351016) (← 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)
- On the chromatic number of a space with a forbidden regular simplex (Q2358587) (← links)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- On the chromatic number for a set of metric spaces (Q2435955) (← links)
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (Q2452861) (← links)
- On the Borsuk and Erdős-Hadwiger numbers (Q2473700) (← links)
