The unique maximal induced subgraph with minimum vertex degree at least , possibly empty. It is found by repeatedly deleting vertices of degree below . The k-core peeling invariant proves that every subgraph satisfying that degree bound survives inside the result; in particular the final vertex set does not depend on deletion order.
New to topics? Read the docs here!