5 citations · 12 across the 13 of their papers we have counts for
1 paper · 1 filter
Lucas Colucci, András Gyárfás
A hypergraph is 2-intersecting if any two edges intersect in at least two vertices. Blais, Weinstein and Yoshida asked (as a first step to a more general problem) whether every 2-i…