• Densities in large permutations and parameter testing 

      Glebov, Roman; Hoppen, Carlos; Klimošová, Tereza; Kohayakawa, Yoshiharu; Král', Daniel; Liu, Hong (2017) [Artigo de periódico]
      A classical theorem of Erdős, Lovász and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permutations and we then apply the methods used ...