The minimum number of maximal independent sets in twin-free graphs

DOI10.37236/12789MaRDI QIDQ6671603zbMATH OpenFDO

Authors Stijn Cambie, Stephan Wagner

Publication date 27 January 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Trees without twin-leaves with smallest number of maximal independent sets
• The number of maximal independent sets in connected triangle-free graphs
• The number of maximum independent sets in graphs
• On the number of maximal independent sets: From Moon–Moser to Hujter–Tuza

Cites work

• scientific article; zbMATH DE number 3453609 (Why is no real title available?)
• A Note on Independent Sets in Trees
• Constraints on the number of maximal independent sets in graphs
• Coverings, matchings and the number of maximal independent sets of graphs
• Induced matchings in graphs of bounded maximum degree
• On Helly families of maximal size
• On cliques in graphs
• On the induced matching problem
• On the number of maximal independent sets in a graph
• Structural properties of twin-free graphs
• The Number of Edges in a k–Helly Hypergraph
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• The Number of Maximal Independent Sets in a Tree
• The maximum number of maximal independent sets in unicyclic connected graphs
• The number of maximal independent sets in a connected graph
• The number of maximal independent sets in connected graphs
• The number of maximal independent sets in connected triangle-free graphs
• The number of maximal independent sets in the Hamming cube

This page was built for publication: The minimum number of maximal independent sets in twin-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671603)