Improved Frankl-Rödl theorem and some of its geometric consequences
For a subset \(S\subset \mathbb{R}^d\), \(\chi_S\left(\mathbb{R}^n\right)\) is the least number of colors in which the points of \(\mathbb{R}^n\) can be so colored that no subset congruent to \(S\) is completely monochrome; where \(d=2\) and \(S\) is the vertex-set of an equilateral triangle, the symbol is written \(\chi_\triangle\left(\mathbb{R}^n\right)\). In Theorem 1: \(\chi_\triangle\left(\mathbb{R}^n\right)\ge (1.00085)^n+{\text o}(1)\), the author improves on a bound he published earlier in [Izv. Math. 82, No. 6, 1196--1224 (2018; Zbl 1404.05058); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 82, No. 6, 128--157 (2018)]. \(\xi_k(\mathbb{R}^n)\) is the maximum chromatic number of distance graphs in \(\mathbb{R}^n\) of girths \(>k\ge3\). It is known [\textit{A. B. Kupavskii}, Mosc. J. Comb. Number Theory 2, No. 2, 52--62 (2012; Zbl 1270.05044)] that there exists a largest constant \(\xi_k>1\) such that \(\xi_k(\mathbb{R}^n)\ge(\xi_k+{\text o}(1))^n\) as \(n\to\infty\). The author provides an improved lower bound for \(\xi_k\) in Theorem 2: \(\xi_k\ge1+\left(\frac16+{\text o}(1)\right)^2\left(\frac1{k\log_2k}\right)^2\). These improvements are achieved through refinement of a result in [\textit{P. Frankl} and \textit{V. Rödl}, Trans. Am. Math. Soc. 300, 259--286 (1987; Zbl 0611.05002)].
- On the Frankl-Rödl theorem
- 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
- On the chromatic number of a space with forbidden equilateral triangle
- Improvements of the Frankl-Rödl theorem and geometric consequences
- On a Frankl-Rödl theorem and its geometric corollaries
- A Partition Property of Simplices in Euclidean Space
- All regular polytopes are Ramsey
- All Triangles are Ramsey
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Coloring distance graphs and graphs of diameters
- Combinatorial geometry and coding theory
- Distance graphs with large chromatic number and arbitrary girth
- Forbidden Intersections
- scientific article; zbMATH DE number 6536189 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 1452727 (Why is no real title available?)
- scientific article; zbMATH DE number 2112063 (Why is no real title available?)
- scientific article; zbMATH DE number 1406333 (Why is no real title available?)
- scientific article; zbMATH DE number 3246419 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- 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
- Intersection theorems with geometric consequences
- Lower bounds for the chromatic numbers of distance graphs with large girth
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On a bound in extremal combinatorics
- On the chromatic number of a space
- On the chromatic number of a space with a forbidden regular simplex
- On the chromatic number of a space with forbidden equilateral triangle
- On the Frankl-Rödl theorem
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Permutation Groups in Euclidean Ramsey Theory
- The chromatic number of the plane is at least 5
- The difference between consecutive primes. II
- The realization of distances within sets in Euclidean space
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- On a Frankl-Rödl theorem and its geometric corollaries
- On a Frankl-Wilson theorem
- Estimate of the number of edges in special subgraphs of a distance graph
- On the chromatic numbers corresponding to exponentially Ramsey sets
- Exponentially Ramsey sets
- On the partition of an odd number into three primes in a prescribed proportion
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- The number of edges in induced subgraphs of some distance graphs
- Counterexamples to Borsuk's conjecture with large girth
- Improvements of the Frankl-Rödl theorem and geometric consequences
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- On the Frankl-Rödl theorem
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- 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
- A recursive Lovász theta number for simplex-avoiding sets
- Monochromatic equilateral triangles in the unit distance graph
- On the chromatic number of a space with forbidden equilateral triangle
- On a Frankl-Wilson theorem and its geometric corollaries
- Generalized Borsuk graphs
- Geometric Graphs with Exponential Chromatic Number and Arbitrary Girth
- Johnson graphs, their random subgraphs, and some of their extremal characteristics
This page was built for publication: Improved Frankl-Rödl theorem and some of its geometric consequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2314149)
