Extremal problems for independent set enumeration
The electronic journal of combinatorics, Tome 18 (2011) no. 1
The study of the number of independent sets in a graph has a rich history. Recently, Kahn proved that disjoint unions of $K_{r,r}$'s have the maximum number of independent sets amongst $r$-regular bipartite graphs. Zhao extended this to all $r$-regular graphs. If we instead restrict the class of graphs to those on a fixed number of vertices and edges, then the Kruskal-Katona theorem implies that the graph with the maximum number of independent sets is the lex graph, where edges form an initial segment of the lexicographic ordering. In this paper, we study three related questions. Firstly, we prove that the lex graph has the maximum number of weighted independent sets for any appropriate weighting. Secondly, we solve the problem of maximizing the number of independents sets in graphs with specified independence number or clique number. Finally, for $m\leq n$, we find the graphs with the minimum number of independent sets for graphs with $n$ vertices and $m$ edges.
@article{10_37236_656,
author = {Jonathan Cutler and A. J. Radcliffe},
title = {Extremal problems for independent set enumeration},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/656},
zbl = {1229.05138},
url = {http://geodesic.mathdoc.fr/articles/10.37236/656/}
}
Jonathan Cutler; A. J. Radcliffe. Extremal problems for independent set enumeration. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/656
Cité par Sources :