Abstract
We connect two classical results in extremal graph theory concerning the number of maximal independent sets. The maximum number mis of maximal independent sets in an -vertex graph was determined by Moon and Moser. The maximum number mis of maximal independent sets in an -vertex triangle-free graph was determined by Hujter and Tuza. We determine the maximum number mis of maximal independent sets in an -vertex graph containing no induced triangle matching of size . We also reprove a stability result of Kahn and Park on the maximum number mis of maximal independent sets in an -vertex triangle-free graphs containing no induced matching of size .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.