论文信息 - Measure preserving homomorphisms and independent sets in tensor graph powers

Measure preserving homomorphisms and independent sets in tensor graph powers

In this note, we study the behavior of independent sets of maximum probability measure in tensor graph powers. To do this, we introduce an upper bound using measure preserving homomorphisms. This work extends some previous results concerning independence ratios of tensor graph powers.

Pooya Hatami | Babak Behsaz

[1] Douglas F. Rall,et al. The Ultimate Categorical Independence Ratio of a Graph , 1996, SIAM J. Discret. Math..

[2] Irit Dinur,et al. Proof of an Intersection Theorem via Graph Homomorphisms , 2006, Electron. J. Comb..

[3] N. Alon,et al. Graph Products, Fourier Analysis and Spectral Techniques , 2004 .

[4] Xuding Zhu. Star chromatic numbers and products of graphs , 1992, J. Graph Theory.

[5] N. S. Barnett,et al. Private communication , 1969 .

[6] Noga Alon,et al. Independent sets in tensor graph powers , 2007, J. Graph Theory.