asked whether there exists a pair of polygons with p sides each, having the property that the vertices of one polygon lie on the lines through the edges of the other polygon, and vice versa. If so, the vertices and edges of these polygons would form a projective configuration. For p = 4 there is no solution in the Euclidean plane, but found pairs of polygons of this type, for a generalization of the problem in which the points and edges belong to the complex projective plane. That is, in Kantor's solution, the coordinates of the polygon vertices are complex numbers. Kantor's solution for p = 4, a pair of mutually-inscribed quadrilaterals in the complex projective plane, is called the Möbius–Kantor configuration. The Möbius–Kantor graph derives its name from being the Levi graph of the Möbius–Kantor configuration. It has one vertex per point and one vertex per triple, with an edge connecting two vertices if they correspond to a point and to a triple that contains that point. The configuration may also be described algebraically in terms of the abelian group with nine elements. This group has four subgroups of order three, each of which can be used to partition the nine group elements into three cosets of three elements per coset. These nine elements and twelve cosets form a configuration, the Hesse configuration. Removing the zero element and the four cosets containing zero gives rise to the Möbius–Kantor configuration.
The Möbius–Kantor graph is a subgraph of the four-dimensional hypercube graph, formed by removing eight edges from the hypercube. Since the hypercube is a unit distance graph, the Möbius–Kantor graph can also be drawn in the plane with all edges unit length, although such a drawing will necessarily have some pairs of crossing edges. The Möbius–Kantor graph also occurs many times as in induced subgraph of the Hoffman–Singleton graph. Each of these instances is in fact an eigenvector of the Hoffman-Singleton graph, with associated eigenvalue -3. Each vertex not in the induced Möbius–Kantor graph is adjacent to exactly four vertices in the Möbius–Kantor graph, two each in half of a bipartition of the Möbius–Kantor graph.
Topology
The Möbius–Kantor graph cannot be embedded without crossings in the plane; it has crossing number 4, and is the smallest cubic graph with that crossing number. Additionally, it provides an example of a graph all of whose subgraphs' crossing numbers differ from it by two or more. However, it is a toroidal graph: it has an embedding in the torus in which all faces are hexagons. The dual graph of this embedding is the hyperoctahedral graphK2,2,2,2. There is an even more symmetric embedding of Möbius–Kantor graph in the double torus which is a regular map, with six octagonal faces, in which all 96 symmetries of the graph can be realized as symmetries of the embedding; credits this embedding to. Its 96-element symmetry group has a Cayley graph that can itself be embedded on the double torus, and was shown by to be the unique group with genus two. The Cayley graph on 96 vertices is a flag graph of the genus 2 regular map having Möbius–Kantor graph as a skeleton. This means it can be obtained from the regular map as a skeleton of the dual of its barycentric subdivision. A sculpture by DeWitt Godfrey and Duane Martinez showing the double torus embedding of the symmetries of the Möbius–Kantor graph was unveiled at the Technical Museum of Slovenia as part of the 6th Slovenian International Conference on Graph Theory in 2007. In 2013 a rotating version of the sculpture was unveiled at Colgate University. The Möbius–Kantor graph admits an embedding into a triple torus that is a regular map having four 12-gonal faces, and is the Petrie dual of the double torus embedding described above;. , motivated by an investigation of potential chemical structures of carbon compounds, studied the family of all embeddings of the Möbius–Kantor graph onto 2-manifolds; they showed that there are 759 inequivalent embeddings.
Algebraic properties
The automorphism group of the Möbius–Kantor graph is a group of order 96. It acts transitively on the vertices, on the edges and on the arcs of the graph. Therefore the Möbius–Kantor graph is a symmetric graph. It has automorphisms that take any vertex to any other vertex and any edge to any other edge. According to the Foster census, the Möbius–Kantor graph is the unique cubic symmetric graph with 16 vertices, and the smallest cubic symmetric graph which is not also distance-transitive. The Möbius–Kantor graph is also a Cayley graph. The generalized Petersen graphG is vertex-transitive if and only ifn = 10 and k =2 or if k2 ≡ ±1 and is edge-transitive only in the following seven cases: =,,,,,, or . So the Möbius–Kantor graph is one of only seven symmetric Generalized Petersen graphs. Its symmetric double torus embedding is correspondingly one of only seven regular cubic maps in which the total number of vertices is twice the number of vertices per face. Among the seven symmetric generalized Petersen graphs are the cubical graph, the Petersen graph, the dodecahedral graph, the Desargues graph and the Nauru graph. The characteristic polynomial of the Möbius–Kantor graph is equal to
