论文信息 - Intersection number and capacities of graphs

Intersection number and capacities of graphs

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.

J. Körner | J. Körner

[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

[2] Vojtech Rödl,et al. On qualitatively independent partitions and related problems , 1983, Discret. Appl. Math..

[3] Edward Szpilrajn-Marczewski. Sur deux propriétés des classes d'ensembles , 1945 .

[4] I. Csiszár. Information Theory , 1981 .

[5] P. Erdös,et al. The Representation of a Graph by Set Intersections , 1966, Canadian Journal of Mathematics.

[6] Luisa Gargano,et al. Capacities: From Information Theory to Extremal Set Theory , 1994, J. Comb. Theory, Ser. A.

[7] Luisa Gargano,et al. Sperner capacities , 1993, Graphs Comb..

[8] Douglas B. West,et al. Parameters of Partial Orders and Graphs: Packing, Covering, and Representation , 1985 .

[9] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[10] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[11] Zsolt Tuza,et al. On the maximum number of qualitatively independent partitions , 1989, J. Comb. Theory, Ser. A.

[12] Fred S. Roberts,et al. Applications of edge coverings by cliques , 1985, Discret. Appl. Math..

[13] Frank Harary,et al. Graph Theory , 2016 .

[14] Edward Marczewski. Indépendance d'ensembles et prolongement de mesures (Résultats et problèmes) , 1948 .