1. The result
1.1.
A finite simple graph is called a graph, if for all , the unit sphere (the graph generated by the vertices attached to ) is a sphere. A graph is called a sphere if it is a graph and removing one vertex renders (the graph with and all connections to removed) is contractible. A graph is called contractible if there exists a vertex so that and are both contractible. These inductive definitions define dgraphs, which are discrete manifolds or dspheres which are discrete spheres. The assumptions are primed by the assumption that the empty graph is a sphere and that the point graph is contractible. A wheel graph , the unit ball of a point in a 2graph, is called embedded in if it is a subgraph of and if its vertex set generates . In other words, is embedded if every simplex in built from vertices in is a simples of . A graph is declared to have positive curvature, if all embedded wheel graphs have less than boundary points. This means that the wheel graph itself including the center has or vertices. These rather strong curvature assumption allow for a rather strong conclusion:
Theorem 1 (Simple sphere theorem).
For , every connected positive curvature graph is a sphere.
1.2.
One could also call it the Mickey Mouse sphere theorem. According to [16], Raoul Bott once asked Richard Stanley why he wanted to work on a “Mickey Mouse subject”. Bott obviously was teasing as he showed also great respect for Rotastyle combinatorics (still according to [16]). A reference to Mickey Mouse appears also in [18] but in the context of hyperbolic surfaces, which can have the shape of a mouse. The name is fitting in the positive curvature case, as there are very few graphs which have positive curvature and they are all very small.
1.3.
We need as for , the connectedness condition gives the point graph , which is not a sphere. For also, the curvature condition is mute, but all connected graphs are spheres. For , the curvature of a positive curvature graph is . The largest positive curvature graph, the icosahedron with constant curvature , has diameter . The smallest positive curvature graph, the octahedron with constant curvature , has diameter . As we will see, there are exactly six positive curvature graphs in dimension .
1.4.
In higher dimensions, we argue with a geomag lemma: any geodesic arc between two points can be extended to an embedded sphere . This surface is by no means unique in general. It might surprise that no orientation assumption as in the continuum is needed. It turns out that the strong curvature condition does not allow for enough room to produce a discrete projective plane. As the completion of the arc to a dimensional discrete surface has diameter , also has diameter . As dimensional spheres are simply connected, there are no shortest geodesic curves which are not homotopic to a point. Actually, a half sphere containing the closed geodesic defines the homotopy deformation, as it collapses a closed loop on the equator to a point on the pole. This is a discrete Synge theorem. But the simple sphere theorem for graphs holds without orientability assumption.
1.5.
To see that must be a sphere, we first note that in a positive curvature graph, the union of unit balls centered at a unit ball is a ball. In other words, the set of vertices in distance form a ball. (This statement can fail if the positive curvature assumption is dropped, as then can become nonsimply connected already). Now pick a point and take , the graph generated by all vertices in distance or less from . This is either a ball or the entire . In the later case, just remove one vertex with maximal distance to so that has a sphere boundary and is contractible. In the former case, cover every vertex with a ball in but always avoid a fixed vertex . We have now covered in a way to see that it is contractible. By definition, is then a sphere.
1.6.
Negative curvature graphs can be defined similarly. But the definition shows
more limitations there: we have so far not seen any negative curvature
graphs, if negative curvature means that all
embedded wheel graphs in have more than boundary points. One can
exclude them easily in dimensions larger than :
Remark. There are no negative curvature graphs for .
Proof.
For , any collection of intersections of neighboring unit spheres produces a sphere . As has Euler characteristic , GaussBonnet leads to some positive curvature and so at least and maximally wheel graphs with less than vertices. For a graph for example, the unit spheres are 2spheres which must contain at least 6 positive curvature wheel graphs. For a graph, a discrete analogue of a manifold, the unit spheres are spheres which by assumption have to have positive curvature too. As we have established already, this graph contains then spheres and so some positive curvature. ∎
1.7.
What remains to be analyzed is the case . There are a priori only finitely many connected negative curvature graphs with a given genus because the genus defines the Euler characteristic . As the curvature of every vertex of a negative curvature graph is , we see from the GaussBonnet formula that the number of vertices in is bounded above by .
1.8.
We currently believe it should be not too difficult to prove that there are no negative curvature graphs in the case too. The first case is genus , in which case . As the negative curvature closest to is , the number of vertices must be or less. So, the question is whether there is a graph with vertices and negative curvature. In that particular case , there is none. In general, it appears that there not enough vertices to generate the “holes” needed. We have not a formal proof of this statement for larger but believe it can go along similar lines as in the case : if we look at the wheel graph centered at some vertex, then we already use vertices. Only 4 vertices are left to build a 2graph. But they are already needed to satisfy the degree 7 requirement. Having no vertices (magnetic balls) any more to continue building, we have to identify boundary points. Any such identification produces loops of length which is not compatible with having a graph (every unit circle must be a circular graph with 4 or more vertices).
2. Twodimensional graphs
2.1.
For , we know that the curvatures are constant in the octahedron (curvature is constant ) and icosahedron case (curvature is constant ) and that:
Lemma 1 (Positive curvature 2graphs).
There are exactly six positive curvature 2graphs which are connected. ^{1}^{1}1”Arithmetic is being able to count up to twenty without taking off your shoes.” – Mickey Mouse
Proof.
Because the curvature is and the Euler characteristic can not be larger than for a connected graph, the vertex cardinalities have a priori to be in the set . Given such a vertex cardinality , the edge and face cardinalities , are determined by GaussBonnet and the DehnSommerville relation holding for graphs. The number of curvature vertices has to be in the set because the Euler handshake formula implies that the total vertex degree is even and curvature
vertices are the only odd degree vertices possible in a positive curvature
graph. Note that in all cases, except for the case , two unit discs centered around a curvature vertex always intersect. (This holds simply by looking at the total cardinality as such a wheel graph has 6 vertices and two disjoint discs have 12 vertices. It is only in the icosahedron case that we have two disjoint disks with curvature . That restricts the possibilities. For , and , we have platonic solids. For and , we must have two adjacent vertices with different curvature. In the case , the three degree vertices have to be adjacent. That fixes the structure. The vertex cardinality 11 is missing. There is no positive curvature graph with vertices because such a graph has exactly one degree vertex and otherwise only degree vertices. Look at the point with cardinality and then look at the spheres around it: the sphere of radius must have entries and so define an other degree vertex. ∎2.2.
When this list was was first compiled on July 2 of 2011, it used the builtin polyhedral graph libraries of degree in Mathematica 8. For vertex size smaller or equal to , we then searched with brute force over suitable adjacency matrices and then crossreferenced all twodimensional ones for graph isomorphism.
2.3.
There are always finitely many graphs with fixed vertex cardinality and so finitely many also with nonnegative curvature. How many are there? We believe there are none. The number can grow maximally polynomially in as we must chose vertices with curvature from or vertices of curvature and curvature etc or then 6 curvature 1/6 vertices. While there are infinitely many fullerene type graphs with nonnegative curvature, we also have only finitely many graphs of nonnegative curvature which have no flat disc of fixed radius
. Also here, we do not have even estimates about the number of such graphs depending on
. We only know that it must grow polynomially in because and the number of positive curvature graphs with vertex cardinality is polynomial in . We will in the last section comment on the case when the scalar curvature for graphs is replaced by the Ricci curvature, which is a curvature on edges. Even so Ricci curvature does not satisfy a GaussBonnet formula, there are only finitely many Ricci positive curvature 2graphs but we do not know how many there are.2.4.
From the list of six positive curvature graphs, we see that all positive curvature graphs have diameter or . Two of them have diameter , the icosahedron with vertices, as well as the graph with vertices.
3. Geomag lemma
3.1.
The proof of the simple sphere theorem is elementary and constructive in any dimension. Given a positive curvature graph , we will show that why after removing a vertex , we have a contractible graph . The reason is that if we take away a unit ball, the remaining graph is small of radius so that it can be covered by a ball of radius 2, for which every boundary point is covered with a ball of radius 1. To say it in other words, one can see that is a union of two balls. This is known in the continuum: a dimensional smooth complete manifold which is the union of two balls is homeomorphic to a sphere [13]. This characterization of spheres also holds in the discrete.
3.2.
A graph is called a ball, if it is of the form , where is a sphere. By definition, the boundary of a ball (the set of vertices where is not a sphere), is a sphere because it agrees with of the original sphere . By induction in dimension the unit sphere of a boundary point is a ball because is the unit sphere in .
Lemma 2.
A graph which is the union of two balls is a sphere.
Proof.
Let , where are balls. Take a vertex at the boundary of . By definition, as is contractible, we can remove vertices of until none is available any more and we have only vertices of left. Now we again by definition can remove vertices of , until nothing is left. ∎
3.3.
This is a LusternikSchnirelmann type result [7]. The LusternikSchnirelmann category or simply category of a graph is the minimal number of contractible graphs needed to cover . Define as the minimal number of critical points which an injective function can have on . The LusternikSchnirelmann theorem is . Especially, spheres can be characterized as as the graphs with category . Related is the Reeb sphere theorem which tells that graphs which admit a function with two critical points is a sphere [10]. This implies the 2ball theorem.
3.4.
For a graph , and two vertices , a curve connecting with is called a geodesic arc if there is no shorter curve in connecting and . A closed curve in is called a geodesic loop if for any two vertices in , there is a geodesic arc from which is contained in .
3.5.
The key is the following geomag lemma:
Lemma 3 (Geomag).
a) Given any dimensional surface with boundary embedded in a graph and a point
on the boundary , there exists a wheel graph centered at which extends the surface.
b) Given a geodesic arc from to , there exists a twodimensional embedded
surface (a 2graph with boundary) which contains .
Proof.
a) Let be a boundary point of the surface , (a boundary point is a point where
is an arc on the sphere and not a circle).
We can now build a geodesic on connecting the arc but which is disjoint
from the arc (see the lemma below).
This circle completion extends the surface to a larger surface by including the “magnets”
from the arc .
b) Start with the boundary point of the geodesic arc and build a wheel graph centered at
. Now extend the surface as in part at . Continue extending the surface until
reaching . Now, we have a twodimensional surface with boundary.
∎
3.6.
Here is an other lemma which is inductively used to extend a surface.
Lemma 4.
Given two vertices in a sphere and a geodesic arc , then there this arc can be extended to a circle in (a circle in is an embedded graph in ).
Proof.
We remove a distance neighborhood of nonboundary points of in . The graph can be constructed as the union of all unitballs centered at vertices of different from . Now just take a geodesic in the graph . It completes the graph and does not touch in any place different from . ∎
3.7.
The example of the octahedron graph and two an arc connecting two antipodal vertices in is a situation, where the circle completion is unique.
3.8.
A consequence is:
Corollary 1 (Loop extension).
Any geodesic loop is part of a graph which is immersed in .
3.9.
More importantly, we have BonnetMyers theorem type result which bounds the diameter of positive curvature graphs:
Corollary 2.
The diameter of any positive curvature graph is .
3.10.
There is no obvious analogue of the classical Cheng rigidity theorem characterizing positive curvature manifolds with maximal diameter as “round spheres”. In the graph case, a maximal diameter positive curvature graph can already in dimension lead to different graphs. There are exactly two positive curvature graphs with maximal diameter . And they are notisometric spheres.
3.11.
A graph is simply connected if every closed path in can be deformed to a point. A deformation step replaces two edges in contained in a triangle with the third edge in the triangle (simplex) or then does the reverse, replaces an edge with the complement of a triangle. This is equivalent to the continuum. We can define an addition of equivalence classes of closed curves and get , the fundamental group. It is the same graph as when looking at the classical fundamental group of a geometric realization but we do not need a geometric realization). A graph is simply connected, if the fundamental group is the trivial group.
Corollary 3 (Synge).
Every graph of positive curvature is simply connected.
Proof.
A geodesic loop in can be extended to a 2sphere . This sphere is simply connected. We can deform the loop to a point by making the deformation on . ∎
4. Classical results
4.1.
In this section, we mention some history. The combinatorial version can help to understand a major core point of differential geometry: “local conditions like positive curvature can have a global topological effect”. A special question is to see how positive curvature relates to the diameter or injectivity radius, an other question is how it affects cohomology. The ultimate question is to relate it to a particular class of manifolds like spherical space forms (quotients of a sphere by a finite subgroup of the orthogonal group) or spheres and in which category the relation is done (i.e. continuous or diffeomorphism). For a panoramic view over some major ideas of differential geometry, see [3]. For history, see [2].
4.2.
The topic of search for local conditions enforce global conditions is central in differential geometry. To cite [2]: “since Heinz Hopf in the late 20’s the topic of curvature and topology has been and still remains the strongest incentive for research in Riemannian geometry”. The theme is that positive curvature produces some sort of “sphere” and that negative curvature produces spaces which have universal covers which are Euclidean spaces. The former are sphere theorems pioneered by Hopf and Rauch, the later HadamardCartan type results. In dimension , where curvature assumptions are mute, one has both, a compact and connected 1manifold is always a circle, which is a sphere and the universal cover is the real line. In the continuum, we need an orientability assumption to get Synge or a pinching condition to get a sphere theorem. Localglobal statements appear also in combinatorics: the color theorem is a global statement about the maximal number of colors if the local injectivity condition is satisfied. The color theorem is equivalent to the statement that spheres have chromatic number or .
4.3.
Synge’s theorem of 1936 is one of the oldest general results about positive curvature Riemannian manifolds [17, 6]. It already used a general bound on the diameter which is called Myer’s theorem in terms of the minimal value of the curvature. Synge’s theorem states that a compact orientable and connected positive curvature manifold is simply connected. It is not as deep as the sphere theorem of RauchBergerKlingenberg [14], Berger and Klingenberg (see [3, 13]), which assures that a sufficiently pinched orientable positive curvature manifold is a sphere. More recent are differentiable sphere theorems, in particular the theorem of Brendle and Schoen [4] which assures that a complete, simply connected, quarterpinched Riemannian manifold is diffeomorphic to the standard sphere. By Synge theorem, one can replace the simply connectedness assumption with orientability.
4.4.
Synge’s result [17] telling that a positive curvature manifold is simply connected is appealing as it mixes positive curvature, a local differential geometric notion with orientability and simply connectedness which are both of a global and topological nature. Synge already uses isometry argument. In [11], Synge’s theorem is proven using a theorem of Weinstein which tells that for an evendimensional positive curvature manifold, an orientation preserving isometry has a fixed point. For an odddimensional positive curvature manifold, an orientation reversing orientation has a fixed point. Weinstein’s theorem follows for spheres or projective spaces from the Lefschetz fixed point theorem but it is more general and is also remarkable as it only uses the positive curvature assumption. Synge’s theorem uses calculus of variations: a minimal geodesic connecting with has as a second variation a linear operator which is positive definite and an isometry of a compact oriented even dimensional manifold has a fixed point.
4.5.
As for the beginnings of the sphere theorem, ([4] and the introduction to [5, 15] give overviews), it was Heinz Hopf who, motivated largely by physics, conjectured, starting in 1932 that a sufficiently pinched positive curvature space must be a sphere. After Rauch visited ETH in 1948/1949, he proved the first theorem assuming a pinching condition of a bout . Rauch’s theorem is remarkable as it is the first of this kind. It introduced a “purse string method” which can be seen as a continuous version of a geomag argument. The topological sphere theorem of 1960, proven by M. Berger and W. Klingenberg proves that under the optimal pinching condition an orientable positive curvature manifold has to be a sphere. In 2007, R. Schoen and S. Brendle got then the differential case, using newly available Ricci flow deformation methods.
5. Questions
5.1.
Can one use the geomag idea to design a proof of the classical Synge theorem by some sort of approximation? It would require some more technical things. Start with a geodesic twodimensional surface patch and extend it to a twodimensional surface along a geodesic. Let be a closed curve in which can not be contracted and let be two points in of maximal distance apart. Extend to a surface and smooth it out, still making sure the positive curvature surface remains immersed in . As it is a connected, compact twodimensional Riemannian manifold, it must be the projective plane or the sphere. In the case when is orientable, is orientable too and must be a sphere. One can now contract in the contractible 2dimensional surface .
5.2.
In order to weaken positive curvature to get closer to the continuum sphere theorems, one could use the notion of FormanRicci curvature [1]. Lets just call it Ricci curvature. Ricci curvature of a graph is a function attached to edges. Positive Forman curvature means that for every edge , the Ricci curvature is positive, where . The Ricci curvature does not satisfy any GaussBonnet formula but it is likely to lead to a sphere theorem. We have not counted the number of graphs with that positive Ricci curvature.
5.3.
By averaging curvatures differently, one can get other notions of curvature. Still according to Forman, one can assign a curvature to triangles by where the average of the vertex degrees of the vertices . There is no doubt that there is a sequence of sphere theorems in a combinatorial setting which captures more aspects the continuum and still relies only on the geomag construction idea. This still needs to be done and there will be a threshold, where projective planes will be allowed forcing to include the orientability condition as in the continuum.
5.4.
Various definitions of curvature have been proposed in the discrete. Some of them are quite involved. Looking at second order curvatures does not work well and are computationally complicated. Already in the planar case [8], this Puiseux type curvature already leads to sensitive issues when proving an Umlaufsatz. Ollivier type curvatures [12, 1] are even tougher to work with. We take the point of view that the definition of curvature should be simple and elementary.
5.5.
An interesting open combinatorial problem is to enumerate all positive curvature graphs in , when taking the curvature assumption of this paper. Similarly, we would like to get all dimensional genus graphs of negative curvature (we believe that there are none). All dimensional positive curvature cases are obtained by doing edge refinements starting with the octahedron, We can ask whether every dimensional positive curvature graph can be obtained from edge refinements.
5.6.
One can define notions of Ricci curvatures different than what Forman did. The following definition gives the scalar curvature in the case . Can we prove as in the continuum that positive Ricci curvature, a quantity assigned to edges given as the average of all curvatures of wheel graphs containing , imply a bound on the diameter of ? This would be a more realistic Myers theorem.
5.7.
What possible vertex cardinalities do occur of positive curvature graphs. In two dimensions, we see that for , the icosahedron, the graph with a maximal number of vertices sis unique. Is this true in dimension also? If not how many are there with maximal cardinality. We believe that the suspensions of icosahedron are the largest positive curvature graphs in any dimension. These are the cross polytopes of Schläfli. In the sense defined here, these cross polytopes are the only Platonic spheres in dimension (the other two classically considered, the hypercubes or the hypersimplices are not dgraphs.)
5.8.
In classical differential geometry dealing with manifolds , there are a couple of notions of intrinsic curvature, curvature which does not depend on
being embedded in a higher dimensional space. The theorema egregia of Gauss allows to see sectional curvatures as independent of the embedding and use it to define the Riemann curvature tensor, averaging sectional curvature over 2planes intersecting in a line gives Ricci curvature, averaging all Ricci curvatures gives scalar curvature which enters the Hilbert action. Then there is the Euler curvature, a Pfaffian of the Riemann curvature tensor appears in GaussBonnetChern.
Afterword
5.9.
The topic relating local properties like curvature with global topological features is an interesting theme also in physics. The reason is that basic fundamental laws in physics are local by nature if information needs time to propagate. Curvature in particular is a fundamental local quantity. Relativity relates it to mass and energy. Having a definite sign of curvature is desirable for various reasons. Positive curvature and orientability implies simplyconnectedness. Negative curvature is often dubbed antideSitter and assures no conjugate points for the geodesic flow. This simplifies physics.
5.10.
The original investigations by Heinz Hopf have been motivated by physics. As cited in [15], Hopf wrote in 1932: “The problem of determining the global structure of a space form from its local metric properties and the connected one of metrizing  in the sense of differential geometrya given topological space, may be worthy of interest for physical reasons”. At that time, the geometrization of gravity due to Einstein had been a major drive to investigate more of differential geometry.
5.11.
Cosmological questions related to curvature about spacetime been investigated early, in particular by Willem de Sitter. A de Sitter space is a positive curvature analogue of the Minkowski space. The Synge result that it is simply connected is important as a nonsimply connected manifold produces twin paradox problems, where traveling along a geodesic coming back to the same point in an equivalent reference frame produces serious causality issues.
References

[1]
F. Bauer, B. Hua, J. Jost, S. Liu, and G. Wang.
The geometric meaning of curvature: Local and nonlocal aspects of ricci curvature.
In L. Najman and P. Romon, editors, Modern Approaches to Discrete Curvature, volume 2184 of Lecture Notes in Mathematics. Springer, 2017.  [2] M. Berger. Riemannian Geometry During the Second Half of the Twentieth Century. AMS, 2002.
 [3] M. Berger. A Panoramic View of Riemannian Geometry. Springer Verlag, Berlin, 2003.
 [4] S. Brendle and R. Schoen. Sphere theorems in geometry. In Handbook of geometric analysis, 3, volume 14 of Adv. Lect. Math, pages 41–75. Int. Press, 2010.
 [5] Simon Brendle. Ricci Flow and the Sphere Theorem. Graduate Studies in Mathematics. American Mathematical Society, 2010.
 [6] M.P. do Carmo. Differential forms and applications. Universitext. SpringerVerlag, Berlin, 1994. Translated from the 1971 Portuguese original.

[7]
F. Josellis and O. Knill.
A LusternikSchnirelmann theorem for graphs.
http://arxiv.org/abs/1211.0750, 2012.  [8] O. Knill. A discrete GaussBonnet type theorem. Elemente der Mathematik, 67:1–17, 2012.

[9]
O. Knill.
Coloring graphs using topology.
http://arxiv.org/abs/1410.3173, 2014. 
[10]
O. Knill.
A Reeb sphere theorem in graph theory.
https://arxiv.org/abs/1903.10105, 2019.  [11] A. Mathew. SyngeWeinstein theorems in Riemannian geometry. http://math.uchicago.edu/ amathew/syngew.pdf, 2011.

[12]
Y. Ollivier.
Ricci curvature of Markov chains on metric spaces.
J. Funct. Anal., 256:810–864, 2009.  [13] P. Petersen. Riemannian Geometry. Springer Verlag, second edition, 2006.
 [14] H. E. Rauch. A contribution to differential geometry in the large. Ann. of Math. (2), 54:38–55, 1951.
 [15] R. Schoen. How curvature shapes space. Talk at ETH Zuerich, 2017.
 [16] R. Stanley. How the upper bound conjecture was proved. Ann. Comb, 18:533–539, 2014.
 [17] J.L. Synge. On the connectivity of spaces of positive curvature. Quarterly Journal of Mathematics, 7:316–320, 1936.
 [18] W. Thurston. The geometry and topology of threemanifolds. http://www.msri.org/publications/books/gt3m, 2002.
Comments
There are no comments yet.