Further improving of upper bound on a geometric Ramsey problem
E Lipka - arXiv preprint arXiv:1905.05617, 2019 - arxiv.org
We consider following geometric Ramsey problem: find the least dimension $ n $ such that
for any 2-coloring of edges of complete graph on the points $\{\pm 1\}^ n $ there exists 4 …
for any 2-coloring of edges of complete graph on the points $\{\pm 1\}^ n $ there exists 4 …
[PDF][PDF] Results in Ramsey Theory and Probabilistic Combinatorics
M Lavrov - 2017 - kilthub.cmu.edu
We begin by considering several questions related to the Hales–Jewett Theorem, a central
result in the study of Ramsey theory. We use bounds due to Shelah [46] to attack a …
result in the study of Ramsey theory. We use bounds due to Shelah [46] to attack a …