A note on the pancyclism of block intersection graphs for universal friendship hypergraphs (Q2839729)

The well-known Friendship Theorem states that if \(G\) is a graph in which every pair of vertices has exactly one common neighbour, then \(G\) has a single vertex joined to all others, called ``a universal friend''. In [\textit{V. T. Sós}, Colloq. int. Teorie comb., Roma 1973, Tomo II, 223--233 (1976; Zbl 0361.05022)] an analogous friendship property for 3-uniform hypergraphs is defined and a construction is given satisfying the friendship property that has a universal friend.NEWLINENEWLINEIn the paper under review, for a universal-friend friendship 3-hypergraph, the i-block intersection graphs, shortly i-BIG, are studied. For a universal-friend friendship hypergraph \((X,\mathcal{B})\), the i-BIG of \((X,\mathcal{B})\) is the graph whose vertices are the members of \(\mathcal{B}\) and two vertices \(B\) and \(B'\) are adjacent if and only if they have exactly i elements in common.NEWLINENEWLINEFirst by a simple argument it is shown that for any universal-friend friendship hypergraph the 0-BIG is not Hamiltonian. It is proved that the 1-BIG on at least 8 points is Hamiltonian. Moreover it is shown that 1-BIG is pancyclic, its vertex connectivity is at least \(v-1\), where \(v\) is the number of points of the hypergraph and it is Hamiltonian-connected. 2-BIG is studied in another section and it is shown that the 2-BIG of a universal-friend friendship hypergraph is Hamiltonian and pancyclic.