Maximum bipartite subgraphs of Kneser graphs (Q1121290)

From MaRDI portal
Revision as of 14:33, 19 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
Maximum bipartite subgraphs of Kneser graphs
scientific article

    Statements

    title
    Maximum bipartite subgraphs of Kneser graphs (English)
    0 references
    author
    Svatopluk Poljak
    0 references
    Zsolt Tuza
    0 references
    publication date
    1987
    0 references
    zbMATH Keywords
    maximum number of edges
    0 references
    bipartite subgraph
    0 references
    Kneser graph
    0 references
    exact solution
    0 references
    polytope of a graph
    0 references

    Identifiers

    DOI
    10.1007/BF01788540
    0 references
    zbMATH DE Number
    4103129
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1121290&oldid=34802699"
    Powered by MediaWiki