
theorem Th68:
  for G being _finite _Graph holds MCS:CSeq(G) is eventually-constant
proof
  let G be _finite _Graph;
  take G.order();
  let m be Nat;
  assume G.order() <= m;
  hence (MCS:CSeq(G)).(G.order()) = (MCS:CSeq(G)).m by Th66;
end;
