On uniquely intersectable graphs (Q1817570)

Let \(\alpha\) be a family of nonempty subsets \(\alpha_1,\dots, \alpha_p\) of a finite set \(S\). The intersection graph with respect to the family \(\alpha\), denoted by \(\Omega(S, \alpha)\), is defined to be the graph with vertex set \(\{v_1,\dots, v_p\}\) such that \(v_i\) and \(v_j\) are adjacent if and only if \(\alpha_i\cap \alpha_j\neq \varnothing\). If a graph \(G\) is isomorphic to \(\Omega(S, \alpha)\), then (i) \(\alpha\) is a distinct family realization of the graph \(G\) if \(\alpha\) is a family of distinct subsets of \(S\); if in addition, all the sets in \(\alpha\) have the same cardinality, then \(\alpha\) is a uniform realization; (ii) \(\alpha\) is an antichain realization of \(G\) if \(\alpha\) is an antichain with respect to set inclusion; (iii) \(\alpha\) is a multifamily realization of \(G\) if the sets in \(\alpha\) need not be distinct; if in addition, all the sets in \(\alpha\) have the same cardinality, then \(\alpha\) is a uniform multifamily realization. It is well known that every graph is isomorphic to an intersection graph \(\Omega(S, \alpha)\), where \(\alpha\) can be required to be an antichain, a uniform family or a multifamily realization of the graph. This suggests defining the intersection number of \(G\), denoted by \(w(G)\), to be the minimum cardinality of \(S\) for which \(G\) has a family realization \(\alpha\). The antichain intersection number, denoted by \(w_a(G)\), and the multifamily intersection number, denoted by \(w_m(G)\), and the uniform multifamily intersection number, denoted by \(w_{um}(G)\), are defined in the expected manner. It may be assumed that \(S\) is the union of the elements in the \(\alpha_i\)'s. It is not difficult to see that \(w_m(G)\leq w(G)\leq w_a(G)\leq w_u(G)\). A graph \(G\) is said to be uniquely intersectable (ui) if, given a set \(S\) with \(|S|= w(G)\) and any two families \(\alpha\), \(\beta\) of subsets of \(S\) such that \(\alpha\) and \(\beta\) are both family realizations of \(G\), then \(\beta\) can be obtained from \(\alpha\) by a permutation of elements of \(S\). Graphs that are uniquely intersectable with respect to anitchains (uia) and uniquely intersectable with respect to multifamilies (uim), uniquely intersectable with respect to uniform families (uiu) and uniquely intersectable with respect to uniform multifamilies (uium) are defined similarly. In this paper, results on uniquely intersectable graphs and on intersection graphs with respect to anitchains are extended. In particular it is shown that if a graph is diamond-free and twins-free, then it is ui and if a graph is diamond-free and non-pendant brothers-free, then it is uia. Graphs that are ui and line graphs of triangle-free graphs that are ui are also characterized and a characterization of graphs that are uim is also established.