Minimal consistent systems of local probabilistic relations for AES-like ciphers

In terms of graph-theoretical model we give a complete description of consistent systems of linear (differential) probabilistic relations with minimum number of active S-boxes for AES-like cipher with arbitrary number of rounds, uniformly diffusive permutations and fixed linear (differential) branch numbers of local matrices.