arXiv Analytics

Sign in

arXiv:1602.08736 [math.CO]AbstractReferencesReviewsResources

Uniqueness of the extremal graph in the problem of maximizing the number of independent sets in regular graphs

Alexei Dmitriev, Alex Dainiak

Published 2016-02-28Version 1

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$.

Comments: in Russian
Categories: math.CO, cs.DM
Related articles: Most relevant | Search more
arXiv:math/0310379 [math.CO] (Published 2003-10-23)
Independent sets in certain classes of (almost) regular graphs
arXiv:1109.2445 [math.CO] (Published 2011-09-12, updated 2011-10-17)
A conjecture on independent sets and graph covers
arXiv:1311.4147 [math.CO] (Published 2013-11-17, updated 2014-01-09)
Maximizing the number of independent sets of a fixed size

Links

Toolbox