On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza

Cory Palmer, Balázs Patkós

Research output: Contribution to journalArticlepeer-review

Abstract

We connect two classical results in extremal graph theory concerning the number of maximal independent sets. The maximum number (Figure presented.) of maximal independent sets in an (Figure presented.) -vertex graph was determined by Miller and Muller and independently by Moon and Moser. The maximum number (Figure presented.) of maximal independent sets in an (Figure presented.) -vertex triangle-free graph was determined by Hujter and Tuza. We give a common generalization of these results by determining the maximum number (Figure presented.) of maximal independent sets in an (Figure presented.) -vertex graph containing no induced triangle matching of size (Figure presented.). This also improves a stability result of Kahn and Park on (Figure presented.). Our second result is a new (short) proof of a second stability result of Kahn and Park on the maximum number (Figure presented.) of maximal independent sets in (Figure presented.) -vertex triangle-free graphs containing no induced matching of size (Figure presented.).

Original languageEnglish
Pages (from-to)440-445
Number of pages6
JournalJournal of Graph Theory
Volume104
Issue number2
DOIs
StatePublished - Oct 2023

Keywords

  • extremal graph theory
  • induced (triangle) matchings
  • maximal independent sets
  • stability results

Fingerprint

Dive into the research topics of 'On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza'. Together they form a unique fingerprint.

Cite this