9 citations · 11 across the 4 of their papers we have counts for
1 paper · 1 filter
Andreas Björklund
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks wheth…