Timeline for Name the class of graphs G s.t. every two graphs that can be created by removing one edge from G are isomorphic.
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11, 2022 at 12:23 | comment | added | The Amplitwist |
The link to springerlink.com is also dead. I'm unable to find any snapshots saved on the Wayback Machine.
|
|
| Apr 17, 2014 at 11:09 | comment | added | Patrick Collins | First link is dead. | |
| Apr 11, 2011 at 23:39 | vote | accept | Milligram | ||
| Oct 17, 2010 at 12:29 | comment | added | Gjergji Zaimi | Fixed. I think that pseudosimilarity has been mostly studied only in the finite case. Infinite graphs behave very differently, for example there are infinite graphs that are not regular that have all vertex-deleted subgraphs isomorphic to each other. Also one needs to keep in mind that these problems originated from work on reconstruction conjectures. | |
| Oct 17, 2010 at 12:22 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
added 25 characters in body
|
| Oct 17, 2010 at 12:16 | comment | added | Pete L. Clark | (Our comments crossed each other in the sending. But I don't think that "graph" means "finite graph"! I think it is worth a clarifying edit.) | |
| Oct 17, 2010 at 12:15 | comment | added | Pete L. Clark | @Gjergi: the first reference you give contains the result for finite graphs as Theorem 12.1. I think I constructed a counterexample for infinite graphs in my answer: do you agree? | |
| Oct 17, 2010 at 12:14 | comment | added | Gjergji Zaimi | Where by graph, I mean finite graph :) | |
| Oct 17, 2010 at 12:08 | history | edited | Gjergji Zaimi | CC BY-SA 2.5 |
added 38 characters in body
|
| Oct 17, 2010 at 12:01 | history | answered | Gjergji Zaimi | CC BY-SA 2.5 |