On the number of maximal independent sets in a graph

Combinatorics Miller and Muller (1960) and independently Moon and Moser (1965) determined the maximum number of maximal independent sets in an n-vertex graph. We give a new and simple proof of this result.

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Mathematics and Theoretical Computer Science Ročník 13 no. 3; číslo Combinatorics; s. 17 - 19
Hlavní autor: Wood, David R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Nancy DMTCS 01.11.2011
Discrete Mathematics & Theoretical Computer Science
Témata:
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Computer Science
Discrete Mathematics
Fuzzy sets
Graph theory
Graphs
Set theory
Theorems
Australia
ISSN:1365-8050, 1462-7264, 1365-8050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Combinatorics Miller and Muller (1960) and independently Moon and Moser (1965) determined the maximum number of maximal independent sets in an n-vertex graph. We give a new and simple proof of this result.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.543