Uniqueness of the extremal graph in the problem of maximizing the number of independent sets in regular graphs
Abstract
The main purpose of this paper is to prove the uniqueness of a graph attaining the maximum of the number of independent sets over all k-regular graphs on n vertices for 2k|n.
0
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.