Counting Independent Sets and Generalized Colorings in Graphs with Various Restrictions
收藏Figshare2025-07-21 更新2026-04-28 收录
下载链接：
https://figshare.com/articles/dataset/Counting_Independent_Sets_and_Generalized_Colorings_in_Graphs_with_Various_Restrictions/29555156
下载链接
链接失效反馈官方服务：
资源简介：
An n-vertex, d-regular graph can have at most 2^(n/2+o(n)) independent sets. We address this upper bound when we impose the additional condition that the graph has independence number at most ?. In particular, we show that for a sequence of d_n-regular n-vertex graphs G_n with independence number at most ?_n, if d_n ? 8 and (?_n)/n ? c_? where 0
创建时间：
2025-07-21
