Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph (Q6357442)
From MaRDI portal
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
math.CO
0 references
