On the ultimate categorical independence ratio

Ágnes Tóth
2014 Journal of combinatorial theory. Series B (Print)  
Brown, Nowakowski and Rall defined the ultimate categorical independence ratio of a graph G as A(G) = lim k→∞
doi:10.1016/j.jctb.2014.02.010 fatcat:z7erk3k3hfgczekeym66crtsva