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...

The notion of extensionality of a fuzzy relation w.r.t. a fuzzy equivalence was first introduced by Höhle and Blanchard. Bělohlávek introduced a similar definition of compatibility of a fuzzy relation w.r.t. a fuzzy equality. In [14] we generalized this notion to left compatibility, right compatibility and compatibility of arbitrary fuzzy relations and we characterized them in terms of left and...

Bi-Hamiltonian structures are of great importance in the theory of integrable Hamiltonian systems. The notion of compatibility of symplectic structures is a key aspect of bi-Hamiltonian systems. Because of this, a few different notions of compatibility have been introduced. In this paper we show that, under some additional assumptions, compatibility in the sense of Magri implies a notion of com...