Timeline for Checking if two graphs have the same universal cover
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2011 at 9:55 | answer | added | Jan Arne Telle | timeline score: 4 | |
| Mar 8, 2010 at 20:58 | answer | added | Tomaž Pisanski | timeline score: 4 | |
| Feb 9, 2010 at 14:33 | comment | added | Eric Peterson | I don't think there's anything directly relevant to this question, but you might find Jeff Erickson's notes on computational topology interesting anyway: compgeom.cs.uiuc.edu/~jeffe/teaching/comptop/schedule.html | |
| Feb 9, 2010 at 10:43 | answer | added | John Stillwell | timeline score: 10 | |
| Feb 9, 2010 at 10:09 | vote | accept | Harrison Brown | ||
| Feb 9, 2010 at 9:29 | answer | added | Alon Amit | timeline score: 32 | |
| Feb 9, 2010 at 9:23 | comment | added | Yemon Choi | As Tim says, this ought to be connected to a much-studied POV in geometric/combinatorial group theory: I don't know where this "started", but perhaps these notes by Brent Everitt arxiv.org/abs/math.GR/0606326 might have useful pointers, if not answers for your questions. | |
| Feb 9, 2010 at 9:03 | comment | added | Tim Porter | You don't need differential topology, just ordinary alg. top. will do. There is a useful connection to combinatorial group theory here and browsing through that area may give you ideas w.r.t say Cayley graphs, that will help. One problem that you face is what `the same' should mean in your setting. One idea might be to look at the valence of nodes, but that may be what you have already looked at. I am not a graph theorist so may not be understanding some of the terminology that you are using. | |
| Feb 9, 2010 at 8:47 | history | asked | Harrison Brown | CC BY-SA 2.5 |