Gordian Knot

[Antti Karttunen]

I don't know whether this is related at all, but at least it sounds
interesting:

http://www-math.mit.edu/spams/spring1998/email2.htm

-- Antti


Jon Awbrey wrote:

>o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
>
>speaking of hard problems to while away the idle hours ...
>there was an emumerative way of approaching the graph
>reconstruction conjecture -- has that been solved?
>i had to swear off it some years ago, doctor's orders --
>it had to do with showing two sequences identical or not,
>the enumerator of graphs and the enumerator of another
>defined family of structures that are derived from graphs.
>
>ja
>
>o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
>inquiry e-lab: http://stderr.org/pipermail/inquiry/
>zhongwen wp: http://zh.wikipedia.org/wiki/User:Jon_Awbrey
>wikinfo: http://wikinfo.org/wiki.php?title=User:Jon_Awbrey
>meta: http://www.getwiki.net/wiki.php?title=User:Jon_Awbrey
>wp review: http://wikipediareview.com/index.php?showuser=398
>o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
>
>
>  
>