activity
20182026
most citedSmooth digraphs modulo primitive positive constructability and cyclic loop conditions

6 citations · 15 across the 7 of their papers we have counts for

collaborators
Showing 2022Show all

1 paper · 1 filter

math.RA2022

The Smallest Hard Trees

Manuel Bodirsky, Jakub Bulín, Florian Starke +1

We find an orientation of a tree with 20 vertices such that the corresponding fixed-template constraint satisfaction problem (CSP) is NP-complete, and prove that for every orientat…