2 citations · 3 across the 9 of their papers we have counts for
1 paper · 1 filter
Stefan Geschke, Szymon Głąb, Wiesław Kubiś
Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand…