Separable and equatable hypergraphs (Q2696627)

From MaRDI portal
Revision as of 20:04, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Separable and equatable hypergraphs
scientific article

    Statements

    title
    Separable and equatable hypergraphs (English)
    0 references
    author
    Daniel Deza
    0 references
    Shmuel Onn
    0 references
    publication date
    17 April 2023
    0 references
    zbMATH Keywords
    hypergraph
    0 references
    matroid
    0 references
    combinatorial optimization
    0 references
    threshold graph
    0 references
    Boolean function
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C65
    0 references
    90C35
    0 references
    05B35
    0 references
    06E30
    0 references
    zbMATH DE Number
    7675088
    0 references
    OpenAlex ID
    W4327905048
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2696627&oldid=39204181"
    Powered by MediaWiki