-Let G be a graph. Denote the intersection number of G by in(G); denote that the clique cover number of G by θ(G). Please prove that the intersection number of G is equal to its clique number: in(G) = θ(G).
" Every vertex (set) contains at least one element in common with every other vertex contained within a Clique. I was thinking a long the lines of there is a set S* that contains the sets which make up the graph each set is a vertex and if one set intersects the other set then there is an edge between those vertices."
Thank you
" Every vertex (set) contains at least one element in common with every other vertex contained within a Clique. I was thinking a long the lines of there is a set S* that contains the sets which make up the graph each set is a vertex and if one set intersects the other set then there is an edge between those vertices."
Thank you