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 K-n, 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.
INTERSECTION NUMBER AND CAPACITIES OF GRAPHS / Korner, Janos. - In: DISCRETE MATHEMATICS. - ISSN 0012-365X. - 142:1-3(1995), pp. 169-184. [10.1016/0012-365x(95)00011-k]
INTERSECTION NUMBER AND CAPACITIES OF GRAPHS
KORNER, JANOS
1995
Abstract
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 K-n, 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.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
