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 language | English |
|---|---|
| Pages (from-to) | 440-445 |
| Number of pages | 6 |
| Journal | Journal of Graph Theory |
| Volume | 104 |
| Issue number | 2 |
| DOIs | |
| State | Published - Oct 2023 |
Funding
Palmer's research is supported by a grant from the Simons Foundation #712036. Patkós's research is partially supported by NKFIH grants SNN 129364 and FK 132060.
| Funders | Funder number |
|---|---|
| Simons Foundation | 712036 |
| SNN 129364, FK 132060 |
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver