Pages that link to "Item:Q2189746"
From MaRDI portal
The following pages link to The chromatic number of the plane is at least 5: a new proof (Q2189746):
Displaying 16 items.
- Proof of a conjectured lower bound on the chromatic number of a graph (Q745214) (← links)
- Triangle colorings require at least seven colors (Q2032735) (← links)
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\) (Q2172834) (← links)
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres (Q2675865) (← links)
- A proof from The Book: a lower bound for the polychromatic number of the plane (Q2869398) (← links)
- Collected papers of Leo Moser. Edited by William Moser and Paulo Ribenboim (Q3374877) (← links)
- Finite $\epsilon$-unit distance graphs (Q3390312) (← links)
- The chromatic number of the plane is at least 5 (Q4556186) (← links)
- All finite sets are Ramsey in the maximum norm (Q5011684) (← links)
- A small 6-chromatic two-distance graph in the plane (Q5132836) (← links)
- Avoiding Multiple Repetitions in Euclidean Spaces (Q5208643) (← links)
- Two-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic Progressions (Q6098460) (← links)
- Max-norm Ramsey theory (Q6201895) (← links)
- Annulus graphs in \(\mathbb{R}^d\) (Q6559437) (← links)
- Monochromatic triangles in the max-norm plane (Q6568851) (← links)
- The density of planar sets avoiding unit distances (Q6608036) (← links)
