The selfavoiding walk problem
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Joe Tomkinson.
How many nstep selfavoiding walks exist on a given infinite graph? This question is easy to state but notoriously hard to answer. I will describe the history of the problem, and will summarise progress and open questions, one of which may seem quite elementary.
This talk is part of the The Archimedeans (CU Mathematical Society) series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
