On the Ratio of Shannon Numbers of Graphs
Sharareh Alipour, Amin Gohari, Mehrshad Taziki

TL;DR
This paper introduces the relative fractional independence number between graphs, establishing its properties and applications in bounding Shannon capacities and improving classical lemmas.
Contribution
It defines and analyzes the relative fractional independence number, providing new bounds and applications for graph invariants like Shannon capacity and the No-Homomorphism Lemma.
Findings
Established the equivalence of two approaches for the relative fractional independence number.
Derived explicit bounds for the ratio of Shannon capacities of Cayley graphs.
Computed new bounds for Shannon capacity of Johnson graphs and related invariants.
Abstract
Let be a function that maps two arbitrary graphs and to a non-negative real number such that where is any natural number and is the strong product of with itself times. We establish the equivalence of two different approaches for finding such a function . The common solution obtained through either approach is termed ``the relative fractional independence number of a graph with respect to another graph ". We show this function by and discuss some of its properties. In particular, we show that where can be the independence number, the Shannon capacity, the fractional independence number, the Lov\'{a}sz number, or the Schrijver's or Szegedy's variants of the Lov\'{a}sz…
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
TopicsGraph theory and applications · Limits and Structures in Graph Theory · Graph Labeling and Dimension Problems
