Bipartite graphs can have any number of independent sets (Q1823265)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bipartite graphs can have any number of independent sets |
scientific article; zbMATH DE number 4114699
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bipartite graphs can have any number of independent sets |
scientific article; zbMATH DE number 4114699 |
Statements
Bipartite graphs can have any number of independent sets (English)
0 references
1989
0 references
The main result: For each \(n\geq 1\) there exists a bipartite graph with exactly n independent sets. The result is also restated in terms of partial orders and lattices. Some open problems are raised.
0 references
stable set
0 references
bipartite graph
0 references
independent sets
0 references
