Bipartite graphs can have any number of independent sets (Q1823265)

From MaRDI portal
Revision as of 09:37, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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
    0 references
    stable set
    0 references
    bipartite graph
    0 references
    independent sets
    0 references
    0 references
    0 references

    Identifiers