Densities in large permutations and parameter testing

Glebov, Roman; Hoppen, Carlos; Klimosova, Tereza; Kohayakawa, Yoshiharu; Kral, Daniel; Liu, Hong

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Densities in large permutations and parameter testing

Full text
Author(s):	Glebov, Roman ; Hoppen, Carlos ; Klimosova, Tereza ; Kohayakawa, Yoshiharu ; Kral, Daniel ; Liu, Hong Total Authors: 6
Document type:	Journal article
Source:	EUROPEAN JOURNAL OF COMBINATORICS; v. 60, p. 89-99, FEB 2017.
Web of Science Citations:	2
Abstract
A classical theorem of Erdds, 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. (C) 2016 Elsevier Ltd. All rights reserved. (AU)

FAPESP's process:	13/07699-0 - Research, Innovation and Dissemination Center for Neuromathematics - NeuroMat
Grantee:	Oswaldo Baffa Filho
Support Opportunities:	Research Grants - Research, Innovation and Dissemination Centers - RIDC


FAPESP's process:	13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
Grantee:	Carlos Eduardo Ferreira
Support Opportunities:	Research Projects - Thematic Grants

Short URL