All Triangles are Ramsey
From MaRDI portal
Publication:3731607
DOI10.2307/2000554zbMath0598.05003OpenAlexW4239468824MaRDI QIDQ3731607
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2000554
Related Items
On the chromatic number of a space with a forbidden regular simplex, On chromatic numbers of close-to-Kneser distance graphs, Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets, Finite Euclidean Ramsey theory, Edge-Ramsey theory, On monochromatic configurations for finite colorings, On the number of edges of a uniform hypergraph with a range of allowed intersections, On a Frankl-Rödl theorem and its geometric corollaries, On the Frankl–Rödl theorem, Transitive sets in Euclidean Ramsey theory, Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle, The chromatic number of space with forbidden regular simplex, Suborbits in Knaster's problem, All trapezoids are Ramsey, A Partition Property of Simplices in Euclidean Space, Forbidden Intersections, Exponentially Ramsey sets, Improved Frankl-Rödl theorem and some of its geometric consequences, New lower bounds for the chromatic number of a space with forbidden isosceles triangles, The mathematics of Bruce Rothschild
Cites Work
