Timeline for Are combinatorial configurations whose Levi graphs may be represented as covering graphs over voltage graphs realizable with pseudolines?
Current License: CC BY-SA 2.5
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
Mar 28, 2010 at 3:54 | vote | accept | Leah Wrenn Berman | ||
Mar 20, 2010 at 16:55 | answer | added | Tomaž Pisanski | timeline score: 1 | |
Mar 20, 2010 at 9:42 | comment | added | Tomaž Pisanski | @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. | |
Mar 20, 2010 at 0:41 | comment | added | Michael Lugo | 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.) | |
Mar 19, 2010 at 22:04 | history | asked | Leah Wrenn Berman | CC BY-SA 2.5 |