Diameter graphs in R^4

From MaRDI portal
Publication:741607




Abstract: A extit{diameter graph in mathbbRd} is a graph, whose set of vertices is a finite subset of mathbbRd and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of different extremal properties of diameter graphs in mathbbR4 and on a three-dimensional sphere. We prove an analogue of V'azsonyi's and Borsuk's conjecture for diameter graphs on a three-dimensional sphere with radius greater than 1/sqrt2. We prove Schur's conjecture for diameter graphs in mathbbR4. We also establish the maximum number of triangles a diameter graph in mathbbR4 can have, showing that the extremum is attained only on specific Lenz configurations.









This page was built for publication: Diameter graphs in \({\mathbb R}^4\)

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