Exponentially Ramsey Sets

We study chromatic numbers of spaces $$\mathbb{R}_p^n=(\mathbb{R}^n, \ell_p)$$Rpn=(Rn,ℓp) with forbidden monochromatic sets. For some sets, we for the first time obtain explicit exponentially growing lower bounds for the corresponding chromatic numbers; for some others, we substantially improve previously known bounds.

[1]  Andrei Mikhailovich Raigorodskii.  On the chromatic number of a space , 2000 .

[2]  A. Raigorodskii,et al.  On the maximal number of edges in a uniform hypergraph with one forbidden intersection , 2015 .

[3]  Andrey Kupavskiy,et al.  On the chromatic number of Rn with an arbitrary norm , 2011, Discret. Math..

[4]  Kristal Cantwell.  All regular polytopes are Ramsey , 2007, J. Comb. Theory, Ser. A.

[5]  J. Pintz,et al.  The Difference Between Consecutive Primes , 1996 .

[6]  A. A. Sagdeev,et al.  Improvements of the Frankl–Rödl theorem and geometric consequences , 2017 .

[7]  О хроматическом числе пространства@@@On the chromatic number of a space , 2000 .

[8]  V. Rödl,et al.  A partition property of simplices in Euclidean space , 1990 .

[9]  A. A. Sagdeev,et al.  Improved Frankl–Rödl Theorem and Some of Its Geometric Consequences , 2018, Probl. Inf. Transm..

[10]  Andrei M. Raigorodskii,et al.  New estimates in the problem of the number of edges in a hypergraph with forbidden intersections , 2013, Probl. Inf. Transm..

[11]  J. Pintz,et al.  The Difference Between Consecutive Primes, II , 2001 .

[12]  Kent Cantwell,et al.  Edge-Ramsey theory , 1996, Discret. Comput. Geom..

[13]  C. Rogers,et al.  The realization of distances within sets in Euclidean space , 1972 .

[14]  Paul Erdös,et al.  Euclidean Ramsey Theorems I , 1973, J. Comb. Theory, Ser. A.

[15]  A. Raigorodskii,et al.  Borsuk's problem and the chromatic numbers of some metric spaces , 2001 .

[16]  I. Kríz.  Permutation groups in Euclidean Ramsey theory , 1991 .

[17]  Andrei M. Raigorodskii,et al.  On the chromatic numbers of small-dimensional Euclidean spaces , 2018, Discret. Appl. Math..

[18]  Igor Kríz,et al.  All trapezoids are Ramsey , 1992, Discret. Math..

[19]  On a Bound in Extremal Combinatorics , 2018 .

[20]  R. Prosanov,et al.  Upper Bounds for the Chromatic Numbers of Euclidean Spaces with Forbidden Ramsey Sets , 2018 .

[21]  Andrei Mikhailovich Raigorodskii.  COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: The chromatic number of a space with the metric l_q , 2004 .

[23]  A. Sagdeev,et al.  On the chromatic number of a space with a forbidden regular simplex , 2017 .

[24]  V. Rödl,et al.  All triangles are Ramsey , 1986 .

[25]  V. Rödl,et al.  Strong ramsey properties of simplices , 2004 .

[26]  A. Raigorodskii,et al.  Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection , 2016 .

[27]  J. Spencer.  Ramsey Theory , 1990 .

[28]  Andrei M. Raigorodskii,et al.  On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections , 2017, Probl. Inf. Transm..

[29]  A. Ingham.  The distribution of prime numbers , 1972 .

[30]  Peter Frankl,et al.  Intersection theorems with geometric consequences , 1981, Comb..

[31]  R. Paley.  On Orthogonal Matrices , 1933 .

[32]  A. Raigorodskii,et al.  On the chromatic number of a space with forbidden equilateral triangle , 2014 .

[33]  A. D. Grey.  The chromatic number of the plane is at least 5 , 2018, 1804.02385.

[34]  A. Sagdeev.  On the Frankl–Rödl theorem , 2018, Izvestiya: Mathematics.

[35]  О хроматическом числе пространства с запрещенным равносторонним треугольником@@@On the chromatic number of a space with forbidden equilateral triangle , 2014 .

[36]  A. Raigorodskii,et al.  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 , 2015 .

[37]  Андрей Михайлович Райгородский,et al.  Асимптотическое исследование задачи о максимальном числе ребер однородного гиперграфа с одним запрещенным пересечением@@@An asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection , 2016 .

[38]  Andrei M. Raigorodskii,et al.  Combinatorial Geometry and Coding Theory , 2016, Fundam. Informaticae.