# Are combinatorial configurations whose Levi graphs may be represented as covering graphs over voltage graphs realizable with pseudolines?

This question is related to this previous question. Many combinatorial configurations have Levi graphs which may be represented as derived graphs obtained from voltage graphs over a cyclic group; in a number of such cases, it is possible to represent the combinatorial configuration as a geometric configuration (i.e., using points and straight lines in the Euclidean plane).

Given a bipartite graph which is obtained from a voltage graph, we can view it as a Levi graph of some combinatorial configuration. Is it possible to draw all such configurations using pseudolines? If not, are there easy/known constraints on the ones that fail? (e.g., if there are more than x points in the configuration, then things work? You can't use such-and-so groups as the cyclic group for the voltage graph?)

(Does the Heawood graph have a voltage-graph representation? If so, it makes the first question easy to answer, but the second one is still interesting. Maybe.)

• It might help if you define voltage graphs or link to a definition of them. (It might not, though, because perhaps anybody who can answer this question already knows what a voltage graph is.) – Michael Lugo Mar 20 '10 at 0:41
• @Michael: "Voltage graph" is a combinatorial tool composed of the base graph and the assignment of group elements to arcs in such a way that the opposing arcs of an edge are assigned inverse group elements. It completely describes the covering graph together with the regular covering projection. The term is explained and used a lot in the book "Topological Graph Theory" by Gross and Tucker. – Tomaž Pisanski Mar 20 '10 at 9:42