Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Discrete mathematics,Graph,Combinatorics,Permutation,Mathematics |
DocType | Volume | Citations |
Journal | abs/1412.5622 | 1 |
PageRank | References | Authors |
0.36 | 8 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Glebov | 1 | 53 | 9.26 |
| Carlos Hoppen | 2 | 1 | 0.70 |
| Tereza Klimosova | 3 | 18 | 6.12 |
| Yoshiharu Kohayakawa | 4 | 1 | 0.36 |
| Daniel Král | 5 | 104 | 8.16 |
| Hong Liu | 6 | 39 | 8.54 |