Borsuk and Ramsey type questions in Euclidean space

DOI10.1017/9781316650295.016zbMATH Open1400.05257arXiv1702.03707OpenAlexW2598997707MaRDI QIDQ4686103FDOQ4686103

Authors: Peter Frankl, János Pach, Christian Reiher, Vojtěch Rödl 

Publication date: 9 October 2018

Published in: Connections in Discrete Mathematics (Search for Journal in Brave)

Abstract: We give a short survey of problems and results on (1) diameter graphs and hypergraphs, and (2) geometric Ramsey theory. We also make some modest contributions to both areas. Extending a well known theorem of Kahn and Kalai which disproved Borsuk's conjecture, we show that for any integer $rge2$, there exist $varepsilon=varepsilon(r)>0$ and $d_0=d_0(r)$ with the following property. For every $dge{d}_0$, there is a finite point set $Psubsetmathbb{R}^d$ of diameter $1$ such that no matter how we color the elements of $P$ with fewer than $(1+varepsilon{)}^{sqrtd}$ colors, we can always find $r$ points of the same color, any two of which are at distance $1$.

Full work available at URL: https://arxiv.org/abs/1702.03707

Recommendations

• A note on diameter-Ramsey sets
• Euclidean Ramsey theorems. I
• Lines in Euclidean Ramsey theory
• Recent trends in Euclidean Ramsey theory
• Some old and new problems in combinatorial geometry. I: Around Borsuk's problem

zbMATH Keywords

diameter Ramsey

Mathematics Subject Classification ID

Distance in graphs (05C12) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cited In (3)

• A note on diameter-Ramsey sets
• Borsuk number for planar convex bodies
• Simplices and regular polygonal tori in Euclidean Ramsey theory

This page was built for publication: Borsuk and Ramsey type questions in Euclidean space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4686103)