13 citations · 39 across the 22 of their papers we have counts for
1 paper · 2 filters
Manu Basavaraju, L. Sunil Chandran, Rogers Mathew +1
A family F of permutations of the vertices of a hypergraph H is called "pairwise suitable" for H if, for every pair of disjoint edges in H, there exists a permutation in F in which…