Maximal independent sets in clique-free graphs

TL;DR

This paper investigates the maximum number of maximal independent sets of a fixed size in graphs excluding a clique of size t, establishing bounds and optimality for certain cases.

Contribution

It provides new bounds on the number of MIS's in clique-free graphs, extending previous results and utilizing recent combinatorial work.

Findings

Graphs without a clique K_t can have up to n^{floor(((t-2)k)/(t-1)) - o(1)} MIS's of size k.

The bounds are tight for triangle-free graphs when k ≤ 4.

Utilizes recent advances in combinatorics related to the Ruzsa-Szemerédi problem.

Abstract

Nielsen proved that the maximum number of maximal independent sets (MIS's) of size $k$ in an $n$-vertex graph is asymptotic to $(n/k)^k$, with the extremal construction a disjoint union of $k$ cliques with sizes as close to $n/k$ as possible. In this paper we study how many MIS's of size $k$ an $n$-vertex graph $G$ can have if $G$ does not contain a clique $K_t$. We prove for all fixed $k$ and $t$ that there exist such graphs with $n^{\lfloor\frac{(t-2)k}{t-1}\rfloor-o(1)}$ MIS's of size $k$ by utilizing recent work of Gowers and B. Janzer on a generalization of the Ruzsa-Szemer\'edi problem. We prove that this bound is essentially best possible for triangle-free graphs when $k\le 4$.