饱和数

The saturation number of a graph H, denoted sat(n, H), is the minimum number of edges in an n-vertex graph that does not contain H as a subgraph but becomes H-saturated (i.e., adding any edge creates a copy of H) upon the addition of any further edge. / 图H的饱和数 sat(n, H) 是指在n个顶点的图中，不包含H作为子图但添加任意一条边都会产生H的子图的图的最小边数。

Knowledge type

数学理论

First proposed or discovered

Proposer

Turkey Farm member

Creator

农场主

Last updated

2026-10-26 17:01:54