Densities in large permutations and parameter testing
dc.contributor.author | Glebov, Roman | pt_BR |
dc.contributor.author | Hoppen, Carlos | pt_BR |
dc.contributor.author | Klimošová, Tereza | pt_BR |
dc.contributor.author | Kohayakawa, Yoshiharu | pt_BR |
dc.contributor.author | Král', Daniel | pt_BR |
dc.contributor.author | Liu, Hong | pt_BR |
dc.date.accessioned | 2017-01-04T02:26:53Z | pt_BR |
dc.date.issued | 2017 | pt_BR |
dc.identifier.issn | 0195-6698 | pt_BR |
dc.identifier.uri | http://hdl.handle.net/10183/150413 | pt_BR |
dc.description.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. | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | pt_BR |
dc.relation.ispartof | European journal of combinatorics. London. Vol. 60 (Feb. 2017), p. 89-99. | pt_BR |
dc.rights | Open Access | en |
dc.subject | Perturbações externas | pt_BR |
dc.title | Densities in large permutations and parameter testing | pt_BR |
dc.type | Artigo de periódico | pt_BR |
dc.identifier.nrb | 001006581 | pt_BR |
dc.type.origin | Estrangeiro | pt_BR |
Files in this item
This item is licensed under a Creative Commons License
-
Journal Articles (39774)Exact and Earth Sciences (6068)