论文标题
未成年人的饱和数字
Saturation Numbers for Minors
论文作者
论文摘要
饱和数$ \ text {sat}（n，\ nathcal {f}）$是任何图中不包含$ \ mathcal {f} $的成员的最小边数，作为一个子图，但是如果添加任何边缘，将会添加任何边缘。我们为未成年人提供了几个上限和下限。特别是，我们将证明某些广义Petersen图为$ K^r $ -minor，以$ 6 \ le r \ le 8 $饱和。
The saturation number $\text{sat}(n,\mathcal{F})$ is the minimum number of edges in any graph which does not contain a member of $\mathcal{F}$ as a subgraph, but will if any edge is added. We give a few upper and lower bounds for saturation numbers for minors. In particular, we shall show that certain Generalized Petersen Graphs are $K^r$-minor saturated for $6\le r\le 8$.
