2014/12/17 by Roman Glebov, Carlos Hoppen, Glebov, Roman +9
Computer Science · Mathematics · #05A05 (Secondary) #68R05 (Primary) #Bayesian Methods and Mixture Models #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1412.5622
openalex publication_date 2014/12/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 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.