Densities in large permutations and parameter testing

Detalhes bibliográficos
Autor(a) principal: Glebov, Roman
Data de Publicação: 2017
Outros Autores: Hoppen, Carlos, Klimošová, Tereza, Kohayakawa, Yoshiharu, Král', Daniel, Liu, Hong
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UFRGS
Texto Completo: http://hdl.handle.net/10183/150413
Resumo: 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.
id UFRGS-2_3c4c3013f1614bedda210feb98a31da8
oai_identifier_str oai:www.lume.ufrgs.br:10183/150413
network_acronym_str UFRGS-2
network_name_str Repositório Institucional da UFRGS
repository_id_str
spelling Glebov, RomanHoppen, CarlosKlimošová, TerezaKohayakawa, YoshiharuKrál', DanielLiu, Hong2017-01-04T02:26:53Z20170195-6698http://hdl.handle.net/10183/150413001006581A 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.application/pdfengEuropean journal of combinatorics. London. Vol. 60 (Feb. 2017), p. 89-99.Perturbações externasDensities in large permutations and parameter testingEstrangeiroinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSORIGINAL001006581.pdf001006581.pdfTexto completo (inglês)application/pdf446695http://www.lume.ufrgs.br/bitstream/10183/150413/1/001006581.pdf5c8301551b7181b8eaaed20f4a8431ddMD51TEXT001006581.pdf.txt001006581.pdf.txtExtracted Texttext/plain37005http://www.lume.ufrgs.br/bitstream/10183/150413/2/001006581.pdf.txtc33b39bb8f168f83569c00d4dba0551bMD52THUMBNAIL001006581.pdf.jpg001006581.pdf.jpgGenerated Thumbnailimage/jpeg1830http://www.lume.ufrgs.br/bitstream/10183/150413/3/001006581.pdf.jpg5419ae4addcf213bf30c9ca1d9d34aeaMD5310183/1504132018-10-30 08:06:02.711oai:www.lume.ufrgs.br:10183/150413Repositório de PublicaçõesPUBhttps://lume.ufrgs.br/oai/requestopendoar:2018-10-30T11:06:02Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false
dc.title.pt_BR.fl_str_mv Densities in large permutations and parameter testing
title Densities in large permutations and parameter testing
spellingShingle Densities in large permutations and parameter testing
Glebov, Roman
Perturbações externas
title_short Densities in large permutations and parameter testing
title_full Densities in large permutations and parameter testing
title_fullStr Densities in large permutations and parameter testing
title_full_unstemmed Densities in large permutations and parameter testing
title_sort Densities in large permutations and parameter testing
author Glebov, Roman
author_facet Glebov, Roman
Hoppen, Carlos
Klimošová, Tereza
Kohayakawa, Yoshiharu
Král', Daniel
Liu, Hong
author_role author
author2 Hoppen, Carlos
Klimošová, Tereza
Kohayakawa, Yoshiharu
Král', Daniel
Liu, Hong
author2_role author
author
author
author
author
dc.contributor.author.fl_str_mv Glebov, Roman
Hoppen, Carlos
Klimošová, Tereza
Kohayakawa, Yoshiharu
Král', Daniel
Liu, Hong
dc.subject.por.fl_str_mv Perturbações externas
topic Perturbações externas
description 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.
publishDate 2017
dc.date.accessioned.fl_str_mv 2017-01-04T02:26:53Z
dc.date.issued.fl_str_mv 2017
dc.type.driver.fl_str_mv Estrangeiro
info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10183/150413
dc.identifier.issn.pt_BR.fl_str_mv 0195-6698
dc.identifier.nrb.pt_BR.fl_str_mv 001006581
identifier_str_mv 0195-6698
001006581
url http://hdl.handle.net/10183/150413
dc.language.iso.fl_str_mv eng
language eng
dc.relation.ispartof.pt_BR.fl_str_mv European journal of combinatorics. London. Vol. 60 (Feb. 2017), p. 89-99.
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFRGS
instname:Universidade Federal do Rio Grande do Sul (UFRGS)
instacron:UFRGS
instname_str Universidade Federal do Rio Grande do Sul (UFRGS)
instacron_str UFRGS
institution UFRGS
reponame_str Repositório Institucional da UFRGS
collection Repositório Institucional da UFRGS
bitstream.url.fl_str_mv http://www.lume.ufrgs.br/bitstream/10183/150413/1/001006581.pdf
http://www.lume.ufrgs.br/bitstream/10183/150413/2/001006581.pdf.txt
http://www.lume.ufrgs.br/bitstream/10183/150413/3/001006581.pdf.jpg
bitstream.checksum.fl_str_mv 5c8301551b7181b8eaaed20f4a8431dd
c33b39bb8f168f83569c00d4dba0551b
5419ae4addcf213bf30c9ca1d9d34aea
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)
repository.mail.fl_str_mv
_version_ 1801224912553115648

Registros relacionados