I. Schur, C. E. Shannon and Ramsey numbers, a short story (Q5931452): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00208-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071622814 / rank | |||
Normal rank |
Latest revision as of 11:36, 30 July 2024
scientific article; zbMATH DE number 1591118
Language | Label | Description | Also known as |
---|---|---|---|
English | I. Schur, C. E. Shannon and Ramsey numbers, a short story |
scientific article; zbMATH DE number 1591118 |
Statements
I. Schur, C. E. Shannon and Ramsey numbers, a short story (English)
0 references
29 March 2002
0 references
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.
0 references
Ramsey numbers
0 references
geometric graphs
0 references
embeddable
0 references