Measure preserving homomorphisms and independent sets in tensor graph powers
Babak Behsaz, Pooya Hatami

TL;DR
This paper investigates the properties of maximum measure independent sets in tensor graph powers, introducing measure preserving homomorphisms to establish upper bounds and extend existing results on independence ratios.
Contribution
It introduces measure preserving homomorphisms to bound independence ratios in tensor graph powers, extending prior work in the field.
Findings
Established upper bounds using measure preserving homomorphisms
Extended previous results on independence ratios
Provided new insights into measure-based properties of tensor graph powers
Abstract
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 about independence ratios of tensor graph powers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Advanced Graph Theory Research
