Densities in large permutations and parameter testing. (February 2017)

• Record Type: Journal Article
• Authors: Glebov, Roman; Hoppen, Carlos; Klimošová, Tereza; Kohayakawa, Yoshiharu; Král', Daniel; Liu, Hong
• Is Part Of: European journal of combinatorics. Volume 60(2017)
• Page Start: 89
• Page End: 99
• Publication Date: 2017-02
• Subjects: Combinatorial analysis -- Periodicals; Analyse combinatoire -- Périodiques; Combinatorial analysis; Periodicals; Electronic journals; 511.6
• DOI: 10.1016/j.ejc.2016.09.006
• Languages: English
• ISSNs: 0195-6698

Abstract

Abstract: 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 in the proof to give an example of a finitely approximable permutation parameter that is not finitely forcible. The latter answers a question posed by two of the authors and Moreira and Sampaio.