Bipartite graphs can have any number of independent sets (Q1823265): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4165427 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3931424 / rank | |||
Normal rank | |||
Latest revision as of 10:37, 20 June 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
