G is an optimally k-EFT (H) graphif G contains the fewest edges among all k-EFT (H) graphs.

• G称为k－EFT（H）优图，若在所有k－EFT（H）图中，G的边数最小。