Let S be a set and let {X1, …, Xn} = be a family of distinct subsets of S. The intersection graph Ω() of has vertex set {X1, …, Xn} and XiXj (i ≠ j) is an edge of Ω() if and only if Xi ∩ Xi ≠ Ø (c.f. (6)). It is easily seen, (7), that every graph is an intersection graph, in other words every graph can be represented by subsets ofa set. Moreover, it was proved by Erdös, Goodman and Pósa (5) that if a graph has n ≥ 4 vertices then one can find a representing set with at most [n2/4] elements. This assertion is an immediate consequence of the result, (5), that the edges of a graph with n ≥ 1 vertices can be covered with at most [n2/4] edge disjoint triangles and edges. We say that a graph G is covered with the subgraphs G1, …, Gk, if every edge of G is in at least one Gi. One of the aims of this note is to prove an extension of this result, pro-posed by Erdös (4).
Mixed metric dimension of graphs with edge disjoint cycles
