2 citations · 3 across the 9 of their papers we have counts for
1 paper · 2 filters
Andy Zucker
Generalizing and simplifying recent work of Dobrinen, we show that if L is a finite binary relational language and F is a finite set of finite irreducible $…