A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172)

In connection with Borsuk's conjecture recently disproved by the authors [``A counterexample to Borsuk's conjecture'', Bull. Am. Math. Soc., New Ser. 29, No. 1, 60-62 (1993; Zbl 0786.52002)], Füredi and Seymour conjectured in mid 80s that in any intersecting hypergraph on \(n\) vertices one can find \(n\) pairs of vertices such that each edge of the hypergraph contains at least one of the pairs. In the present paper the authors disprove that conjecture as well. They create their counterexample randomly and comment: The proof of this (\dots) seems unnecessarily complicated. The authors would appreciate it if someone would find an easier one.