I. Schur, C. E. Shannon and Ramsey numbers, a short story (Q5931452): Difference between revisions

Erdős asked the question: Can every finite triangle-free graph \(G\) be embedded on the unit sphere of an appropriately large Euclidean space so that adjacent vertices are at a distance \(> \sqrt{3}\). The graph \(G\) is said to be \(\sqrt{3}\)-embeddable. The relationship between this embedding question and the determination of an upper bound on the Ramsey number \(r(3, m)\), the largest order \(k\) of a complete graph \(K_k\) that admits an \(m\)-coloring of the edges with no monochromatic \(K_3\), is presented. Some historical notes concerning the origin of the problem of determining \(r(3, m)\) along with related problems are discussed. An update of the latest results on the initial Erdős embedding problem is given along with the conjecture of Larman that for any \(\varepsilon > 0\) there is a triangle-free graph \(G\) that is not \(\sqrt{2 + \varepsilon}\)-embeddable.