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.

Saved in:
Bibliographic Details
Published in:Discrete Mathematics and Theoretical Computer Science Vol. 13 no. 3; no. Combinatorics; pp. 17 - 19
Main Author: Wood, David R.
Format: Journal Article
Language:English
Published: Nancy DMTCS 01.11.2011
Discrete Mathematics & Theoretical Computer Science
Subjects:
[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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.543