The chromatic number of the plane is at least 5

From MaRDI portal
Publication:4556186

zbMath1404.05063arXiv1804.02385MaRDI QIDQ4556186

Aubrey D. N. J. de Grey

Publication date: 23 November 2018

Full work available at URL: https://arxiv.org/abs/1804.02385




Related Items (42)

On the density of sets of the Euclidean plane avoiding distance 1Density estimates of 1-avoiding sets via higher order correlationsOn rainbow isosceles \(n\)-simplexesUnnamed ItemExact square coloring of subcubic planar graphsEmbedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)The geometry and combinatorics of discrete line segment hypergraphsA recursive Lovász theta number for simplex-avoiding setsConstructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheresStill Spinning: The Moser Spindle at SixtyColoring distance graphs on the planeThe chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distancesAlmost-monochromatic sets and the chromatic number of the planeChromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphsThe chromatic number of the plane is at least 5: a new proofNew directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023On a Frankl-Wilson theoremTwo-colorings of normed spaces with no long monochromatic unit arithmetic progressionsTwo-Colorings of Normed Spaces without Long Monochromatic Unit Arithmetic ProgressionsChromatic coloring of distance graphs, IIIOn the chromatic number of 2-dimensional spheresClique numbers of finite unit-quadrance graphsChromatic numbers of Cayley graphs of abelian groups: a matrix methodOdd wheels are not odd-distance graphsOdd distances in colourings of the planeMax-norm Ramsey theoryOn the chromatic numbers corresponding to exponentially Ramsey setsA universal partition result for infinite homogeneous \(K_n\)-free and related graphsMonochromatic equilateral triangles in the unit distance graphThe Namer-Claimer gamePolynomial configurations in sets of positive upper density over local fieldsExponentially Ramsey setsTriangle colorings require at least seven colorsAvoiding Multiple Repetitions in Euclidean SpacesFinite $\epsilon$-unit distance graphsA new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean spaceImproved Frankl-Rödl theorem and some of its geometric consequencesLower bounds for the measurable chromatic number of the hyperbolic planeCounterexamples to Borsuk's conjecture with large girthAll finite sets are Ramsey in the maximum normOdd Wheels Are Not Odd-distance GraphsOn the Babai and Upper Chromatic Numbers of Graphs of Diameter 2




This page was built for publication: The chromatic number of the plane is at least 5