The maximum l-triangle k-club problem: Complexity, properties, and algorithms

•The computational complexity of the problem is established, for any l ≥ 1 and k ≥ 2.•Cohesiveness properties of graphs induced by l-triangle k-clubs are derived.•New valid inequalities are presented.•Solution approaches based on alternative formulations of the problem are proposed.•Numerical result...

Ausführliche Beschreibung