Informatik-Kolloquien
247. Informatik-Kolloquium
Vortrag
Herr Prof. Dr. Carlos Hoppen
Universidade Federal do Rio Grande do Sul
Porto Alegre, Brasilien
"An Erdös-Lovász-Spencer Theorem for permutations and its consequences for parameter testing"
Mittwoch, 09.09.2015
11:30 - 13:00 Uhr, Straße der Nationen 62, 1/367
Alle interessierten Personen sind herzlich eingeladen!
Abstract:
A classical theorem of Erdös, Lovász and Spencer [Strong independence of graphcopy functions, Graph Theory and Related Topics, Academic Press (1979), 165--172] asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permutations and apply the methods used in its proof to give an example of a permutation parameter that is both bounded and testable, but not finitely forcible.
