Maximal cliques and nearly disjoint hypergraphs

Short abstract. Two hypergraphs H_1 and H_2 are called 'nearly disjoint' if every edge of H_1 meets every edge of H_2 in at most one vertex.