Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149): Difference between revisions

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