摘要: In this paper, we are counting natural subsets of graphs subject to local restrictions, such as counting independent sets of vertices, dominating sets of vertices, and independent sets of edges. We will discuss the following counting problems: The number of configurations in each problem grows rapidly, leading to the development of bounds and a discussion of entropy.
参考文章(0)