The minimum number of maximal independent sets in twin-free graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913500876505088 |
|---|---|
| author | Cambie, Stijn Wagner, Stephan |
| author_facet | Cambie, Stijn Wagner, Stephan |
| contents | The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erdős and Moser from the 1960s. The minimum was always considered to be less interesting due to simple examples such as stars. In this paper we show that the problem becomes interesting when restricted to twin-free graphs, where no two vertices have the same open neighbourhood. We consider the question for arbitrary graphs, bipartite graphs and trees. The minimum number of maximal independent sets turns out to be logarithmic in the number of vertices for arbitrary graphs, linear for bipartite graphs and exponential for trees. In the latter case, the minimum and the extremal graphs have been determined earlier by Taletski\uı and Malyshev, but we present a shorter proof. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_04357 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | The minimum number of maximal independent sets in twin-free graphs Cambie, Stijn Wagner, Stephan Combinatorics 05C35, 05C69, 05C05 The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erdős and Moser from the 1960s. The minimum was always considered to be less interesting due to simple examples such as stars. In this paper we show that the problem becomes interesting when restricted to twin-free graphs, where no two vertices have the same open neighbourhood. We consider the question for arbitrary graphs, bipartite graphs and trees. The minimum number of maximal independent sets turns out to be logarithmic in the number of vertices for arbitrary graphs, linear for bipartite graphs and exponential for trees. In the latter case, the minimum and the extremal graphs have been determined earlier by Taletski\uı and Malyshev, but we present a shorter proof. |
| title | The minimum number of maximal independent sets in twin-free graphs |
| topic | Combinatorics 05C35, 05C69, 05C05 |
| url | https://arxiv.org/abs/2211.04357 |