Abstract For the problem to find an m -clique in -partite graph, staircase compatibility has recently been introduced as a polynomial-time solvable special case. It is property of graph together with -partition vertex set and total orders on each subset partition. In optimization problems involving -cliques graphs subproblem, it allows for totally unimodular linear programming formulations, whi...
