Bipartite graphs can have any number of independent sets (Q1823265): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:50, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bipartite graphs can have any number of independent sets |
scientific article |
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