More precisely, the Ktruss subgraph of G is its largest subgraph where every edge belongs to at least K − 2 triangles.
every edge in the K-truss joins two vertices that have at least K − 2 common neighbors.