In graph theory, particularly in the theory of hypergraphs, the line graph of a hypergraph H, denoted L, is the graph whose vertex set is the set of the hyperedges of H, with two vertices adjacent in L when their corresponding hyperedges have a nonempty intersection in H. In other words, L is the intersection graph of a family of finite sets. Wikipedia