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
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11, 2022 at 13:16 | comment | added | Gerry Myerson | And now, (almost) twelve years later, a downvote. This is the MathOverflow equivalent of the pitch-drop experiment (en.wikipedia.org/wiki/Pitch_drop_experiment). | |
| Oct 18, 2010 at 9:20 | comment | added | Gerry Myerson | OK, folks, you can stop now. Two upvotes is more than enough to restore my faith in humanity. | |
| Oct 18, 2010 at 5:46 | comment | added | sleepless in beantown | Gerry, one up-vote delivered. No measles, no rubella, no varicella; decidedly un-measly as up-votes go. :) | |
| Oct 18, 2010 at 5:32 | history | edited | Gerry Myerson | CC BY-SA 2.5 |
summarized situaiton, added pitiful whine
|
| Oct 17, 2010 at 10:18 | history | answered | Gerry Myerson | CC BY-SA 2.5 |