Skip to main content
replaced http://mathoverflow.net/ with https://mathoverflow.net/
Source Link

This question is related to this previous questionthis 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.)

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.)

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.)

Source Link

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.)