Diameter graphs in R^4

DOI10.1007/S00454-014-9581-XzbMATH Open1297.05075OpenAlexW1969866503MaRDI QIDQ741607FDOQ741607

Authors: Andrey B. Kupavskii 

Publication date: 12 September 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: A extit{diameter graph in $mathbb{R}^d$} is a graph, whose set of vertices is a finite subset of $mathbb{R}^d$ 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 $mathbb{R}^4$ 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 $mathbb{R}^4.$ We also establish the maximum number of triangles a diameter graph in $mathbb{R}^4$ can have, showing that the extremum is attained only on specific Lenz configurations.

Full work available at URL: https://arxiv.org/abs/1306.3910

Recommendations

• On Schur's conjecture in \(\mathbb R^4\)
• On Schur's conjecture in \(\mathbb{R}^{4}\)
• Proof of Schur's conjecture in \(\mathbb R^D\)
• On simplices in diameter graphs in \(\mathbb{R}^4\)
• A new proof of Vázsonyi's conjecture

zbMATH Keywords

geometric graphsdiameter graphsnumber of cliquesSchur's conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A counterexample to Borsuk’s conjecture
• A new proof of Vázsonyi's conjecture
• Borsuk's problem and the chromatic numbers of some metric spaces
• Drei Sätze über die n-dimensionale euklidische Sphäre
• On Borsuk's conjecture for two-distance sets
• On Sets of Distances of n Points
• On a problem of K. Zarankiewicz
• Remarks on Schur's conjecture
• Research Problems in Discrete Geometry
• Some properties of graphs of diameters
• The maximum number of unit distances among \(n\) points in dimension four
• Three lectures on the Borsuk partition problem
• Unit distances and diameters in Euclidean spaces
• Zum Borsukschen Zerteilungsproblem

Cited In (14)

• Diameter of 4-colourable graphs
• On Schur's conjecture in \(\mathbb{R}^{4}\)
• Some properties of graphs of diameters
• Proof of Schur's conjecture in \(\mathbb R^D\)
• Ball polytopes and the Vázsonyi problem
• A diameter bound for extensions of the \(F_{4}\)(2)-building
• Nearly \(k\)-distance sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Schur's conjecture in \(\mathbb R^4\)
• On simplices in diameter graphs in \(\mathbb{R}^4\)
• Double-normal pairs in space
• Title not available (Why is that?)

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)