Answer to a question of Alon and Lubetzky about the ultimate categorical independence ratio
Abstract
Brown, Nowakowski and Rall defined the ultimate categorical independence ratio of a graph G as A(G)=k ∞ i(G× k), where i(G)=α (G)|V(G)| denotes the independence ratio of a graph G, and G× k is the k-th categorical power of G. Let a(G)=|U||U|+|NG(U)|: U is an independent set of G, where NG(U) is the neighborhood of U in G. In this paper we answer a question of Alon and Lubetzky, namely we prove that if a(G) 1/2 then A(G)=a(G), and if a(G)>1/2 then A(G)=1. We also discuss some other open problems related to A(G) which are immediately settled by this result.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.