Summary: Two variations of set intersection representation are investigated and upper and lower bounds on the minimum number of labels with which a graph may be represented are found that hold for almost all graphs. Specifically, if \(\theta_k(G)\) is defined to be the minimum number of labels with which \(G\) may be represented using the rule that two vertices are adjacent if and only if they share at least \(k\) labels, there exist positive constants \(c_k\) and \(c_k'\) such that almost every graph \(G\) on \(n\) vertices satisfies \({c_kn^2\over \log^2n}\leq \theta_k(G)\leq {c_k' n^2\over\log^2 n}\).
Changing the representation only slightly by defining \(\theta_{\text{odd}}(G)\) to be the minimum number of labels with which \(G\) can be represented using the rule two vertices are adjacent if and only if they share an odd number of labels results in quite different behavior. Namely, almost every graph \(G\) satisfies \(n-\sqrt{2n} -\lceil\log n\rceil< \theta_{\text{odd}}(G)\leq n-1.\) Furthermore, the upper bound on \(\theta_{\text{odd}}(G)\) holds for every graph.