Intersection number and capacities of graphs Original Research Article

For an arbitrary graph G we determine the asymptotics of the intersection number (edge-clique covering number) of the categorical (or weak) product of G and the complete graph Kn, asymptotically in n. The result follows from a more general theorem on graph capacities which generalizes an earlier result with Gargano and Vaccaro on Sperner capacities.