101 citations · 491 across the 53 of their papers we have counts for
1 paper · 1 filter
Vittorio Cipriani, Arno Pauly
We study the complexity of the following related computational tasks concerning a fixed countable graph G: 1. Does a countable graph H provided as input have a(n induced) subgraph…