49 citations · 228 across the 16 of their papers we have counts for
1 paper · 2 filters
Sergio Caracciolo, Gregor Masbaum, Alan D. Sokal +1
Consider the problem of determining whether there exists a spanning hypertree in a given k-uniform hypergraph. This problem is trivially in P for k=2, and is NP-complete for k>= 4,…