Densities in large permutations and parameter testing

Roman Glebov, Carlos Hoppen, Tereza Klimosova +3

A classical theorem of Erdos, Lovasz and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permuta…