论文信息 - Improvements of the Frankl–Rödl theorem and geometric consequences

Improvements of the Frankl–Rödl theorem and geometric consequences

The Frankl–Rödl classical bound for the number of edges in a hypergraph with forbidden intersections is improved. The improvements are used to obtain new results in Euclidean Ramsey theory and in combinatorial geometry.

[1] Alexander Barg,et al. Discrete Geometry and Algebraic Combinatorics , 2014, Discrete Geometry and Algebraic Combinatorics.

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

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

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

[5] A. Soifer. The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators , 2008 .

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

[7] 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 .

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

[9] A. Sagdeev. Lower bounds for the chromatic numbers of distance graphs with large girth , 2017 .

[10] Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections , 2014 .

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

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