The following pages link to (Q5808059):
Displaying 50 items.
- Bounds on the measurable chromatic number of \({\mathbb{R}}\) (Q1824627) (← links)
- Variations on a game (Q1836601) (← links)
- Patch colorings and rigid colorings of the rational \(n\)-space (Q1850575) (← links)
- Unit-distance graphs, graphs on the integer lattice and a Ramsey type result (Q1909657) (← links)
- On the connectivity of unit distance graphs (Q1923783) (← links)
- On distance subgraphs of graphs in spaces of lower dimensions (Q1948589) (← links)
- Distance graphs with large chromatic number and without large cliques (Q1957062) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- Borsuk's partition problem and finite point sets (Q1992189) (← links)
- Intuitionism: an inspiration? (Q2065727) (← links)
- Beck's coloring of finite product of commutative ring with unity (Q2115147) (← links)
- On the growth rate of chromatic numbers of finite subgraphs (Q2182268) (← links)
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size (Q2190920) (← links)
- Coloring the \(n\)-smooth numbers with \(n\) colors (Q2227831) (← links)
- One problem on geometric Ramsey numbers (Q2258893) (← links)
- The chromatic number of infinite graphs - A survey (Q2275377) (← links)
- R.e. Prime powers and total rigidity (Q2281321) (← links)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← 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)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- Distance Ramsey numbers (Q2375971) (← links)
- Finite sets as complements of finite unions of convex sets (Q2391197) (← links)
- On the structure of the power graph and the enhanced power graph of a group (Q2401396) (← links)
- Chromatic number and clique number of subgraphs of regular graph of matrix algebras (Q2427930) (← links)
- On the chromatic number for a set of metric spaces (Q2435955) (← links)
- Lines in hypergraphs (Q2439836) (← links)
- On the chromatic number of subsets of the Euclidean plane (Q2441349) (← 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)
- An infinite color analogue of Rado's theorem (Q2459498) (← links)
- Around Borsuk's hypothesis (Q2519261) (← links)
- Chromatic numbers of metric spaces (Q2519262) (← links)
- Ein Satz über die Menge aller Färbungen eines endlich färbbaren Graphen (Q2534866) (← links)
- A selection lemma (Q2549321) (← links)
- Distances realized by sets covering the plane (Q2557037) (← links)
- On colorings of maps (Q2565109) (← links)
- A proof of Dilworth's decomposition theorem for partially ordered sets (Q2625477) (← 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)
- On universal positive graphs (Q2687461) (← links)
- On total and regular graphs of a polynomial (Q2689022) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Small clique and large chromatic number (Q2851500) (← links)
- Partition Relations Connected with the Chromatic Number of Graphs (Q3252413) (← links)
- Amorphe Potenzen kompakter Räume (Q3346924) (← links)
- Coloring the Voronoi tessellation of lattices (Q3384034) (← links)
- On the chromatic numbers of metric spaces with few forbidden distances (Q3439592) (← links)
- (Q4368823) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
- The chromatic number of the space $( {\mathbb R}^n, l_1)$ (Q4645149) (← links)
