Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653184 | European Journal of Combinatorics | 2017 | 11 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Roman Glebov, Carlos Hoppen, Tereza Klimošová, Yoshiharu Kohayakawa, Daniel Král’, Hong Liu,