Odd distances in colourings of the plane
From MaRDI portal
Publication:6201484
Abstract: We prove that every finite colouring of the plane contains a monochromatic pair of points at an odd distance from each other.
Cites work
- scientific article; zbMATH DE number 16111 (Why is no real title available?)
- scientific article; zbMATH DE number 874076 (Why is no real title available?)
- A 6-chromatic odd-distance graph in the plane
- A Szemerédi type theorem for sets of positive density in \(\mathbb R^k\)
- A survey of \(\chi\)-boundedness
- Coloring distance graphs on the plane
- Coloring the Voronoi tessellation of lattices
- Distances in positive density sets in R^d
- Forbidden subgraphs of the odd-distance graph
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Odd Wheels Are Not Odd-distance Graphs
- Odd-distance and right-equidistant sets in the maximum and Manhattan metrics
- Odd-distance virtual edges in unit-distance graphs
- On coloring the odd-distance graph
- On the Shannon capacity of a graph
- Open problems in Euclidean Ramsey theory
- Plane Sets with Positive Density at Infinity Contain all Large Distances
- Some of my favorite “lesser known” problems
- Some old and new problems in combinatorial geometry. I: Around Borsuk's problem
- Spectra of graphs with transitive groups
- Spectral bounds for the independence ratio and the chromatic number of an operator
- The Hadwiger-Nelson problem
- The chromatic number of the plane is at least 5
- The odd-distance plane graph
- Topics in Chromatic Graph Theory
This page was built for publication: Odd distances in colourings of the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201484)
