theorem Th66: :: LEXBFS:66

for G being _finite _Graph
for n being Nat st G .order() <= n holds
(MCS:CSeq G) . (G .order()) = (MCS:CSeq G) . n