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.

Podrobná bibliografia

Vydané 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:	English
Vydavateľské údaje:	Nancy DMTCS 01.11.2011 Discrete Mathematics & Theoretical Computer Science
Predmet:	[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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!