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

From MaRDI portal
Created a new Item
 
Added link to MaRDI item.
 
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:04, 10 July 2024

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

    2 January 2021
    0 references
    0 references
    math.CO
    0 references
    0 references
    0 references
    0 references
    0 references