Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph (Q6357442)

From MaRDI portal
Revision as of 10:04, 10 July 2024 by Import240710060729 (talk | contribs) (Added link to MaRDI item.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 900468654
Language Label Description Also known as
English
Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph
scientific article; zbMATH DE number 900468654

    Statements

    publication date
    2 January 2021
    0 references
    arXiv ID
    2101.00507
    0 references
    arXiv classification
    math.CO
    0 references
    author
    Beka Ergemlidze
    0 references
    Abhishek Methuku
    0 references
    Michael Tait
    0 references
    Craig Timmons
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6357442&oldid=35976058"
    Powered by MediaWiki