The well-covered dimension of random graphs (Q864120): Difference between revisions

This article studies the `well-covered' property of finite graphs. The authors begin with a section containing useful definitions, including that a finite graph is well covered if all its maximal independent sets are of the same cardinality. The main result proven in this article is that almost all graphs have a well-covered dimension of zero, or alternatively, almost no graphs are well covered.