The following pages link to The Mathematical Coloring Book (Q3508582):
Displayed 50 items.
- Polynomial configurations in sets of positive upper density over local fields (Q2227134) (← links)
- Kaleidoscopical configurations (Q2255705) (← 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)
- Proof of van der Waerden's theorem in nine figures (Q2313970) (← links)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles (Q2314097) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- On the density of sets avoiding parallelohedron distance 1 (Q2324626) (← 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)
- About an Erdős-Grünbaum conjecture concerning piercing of non-bounded convex sets (Q2351027) (← links)
- New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← 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)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- Same graph, different universe (Q2408074) (← links)
- Improvements of the Frankl-Rödl theorem and geometric consequences (Q2411792) (← links)
- Turán-type bounds for distance graphs (Q2411797) (← links)
- On the chromatic number of subsets of the Euclidean plane (Q2441349) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)
- The Schur degree of additive sets (Q2659244) (← links)
- Special cases and equivalent forms of Katznelson's problem on recurrence (Q2679709) (← links)
- Clique numbers of finite unit-quadrance graphs (Q2688242) (← links)
- Odd wheels are not odd-distance graphs (Q2690119) (← links)
- Semialgebraic graphs having countable list-chromatic numbers (Q2790252) (← links)
- ORTHOGONAL COLORINGS OF THE SPHERE (Q2810736) (← links)
- The Hadwiger–Nelson Problem (Q2827299) (← links)
- On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$ (Q3300687) (← links)
- Finite $\epsilon$-unit distance graphs (Q3390312) (← links)
- Colourful categories (Q3465082) (← links)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs (Q3466410) (← links)
- New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
- Hilbert’s Proof of His Irreducibility Theorem (Q4575980) (← links)
- Another Memorable Mongolian Olympiad Problem: A Two-Colored Rectangular Lattice (Q4576559) (← links)
- On the chromatic number of an infinitesimal plane layer (Q4580441) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
- Hypercube related polytopes (Q4617783) (← links)
- (Q4987401) (← links)
- All finite sets are Ramsey in the maximum norm (Q5011684) (← links)
- Odd Wheels Are Not Odd-distance Graphs (Q5014110) (← links)
- Computation of new diagonal graph Ramsey numbers (Q5054055) (← links)
- A recursive Lovász theta number for simplex-avoiding sets (Q5097318) (← links)
- On the notions of upper and lower density (Q5111608) (← links)
- How (Maximally) Contextual Is Quantum Mechanics? (Q5119676) (← links)
- A Topologically Complete Theory of Weaving (Q5139663) (← links)