A diameter graph in ℝ d is a graph in which vertices are points of a finite subset of ℝ d and two vertices are joined by an edge if the distance between them is equal to the diameter of the vertex set. This paper is devoted to Schur’s conjecture, which asserts that any diameter graph on n vertices in ℝ d contains at most n complete subgraphs of size d. It is known that Schur’s conjecture is true in dimensions d ≤ 3. We prove this conjecture for d = 4 and give a simple proof for d = 3.
Keywordsdiameter graph Schur’s conjecture Borsuk’s conjecture
Unable to display preview. Download preview PDF.
- 3.A. M. Raigorodskii, “Around Borsuk’s hypothesis,” in Contemporary Mathematics: Fundamental Directions, Geometry and Mechanics, Vol. 23: Geometry and Mechanics (Ross. Univ. Druzhby Narodov, Moscow, 2007), pp. 147–164 [J. Math. Sci. 154 (4), 604–623 (2008)].Google Scholar
- 4.A. M. Raigorodskii, “Three lectures on the Borsuk partition problem,” in London Math. Soc. Lecture Note Ser., Vol. 347: Surveys in Contemporary Mathematics(Cambridge Univ. Press, Cambridge, 2008), pp. 202–247.Google Scholar
- 5.K. Borsuk, “Drei Sätzeüber die n-dimensionale euklidische Sphäre,” Fund. Math. 20, 177–190 (1933).Google Scholar
- 9.H. Hopf and E. Pannwitz, “Aufgabe 167,” Jahresbericht Deutsch. Math.-Verein. 43, 114 (1934).Google Scholar
- 10.B. Grünbaum, “A proof of Vászonyi’s conjecture,” Bull. Res. Council Israel. Sec. A 6, 77–78 (1956).Google Scholar
- 14.F. Morić and J. Pach, “Remarks on Schur’s conjecture,” in Lecture Notes in Comput. Sci., Vol. 8296: Computational Geometry and Graphs (Springer-Verlag, Berlin, 2013), pp. 120–131.Google Scholar