Jan Foniok - On Ramsey properties of classes with forbidden trees

lmcs:796 - Logical Methods in Computer Science, August 21, 2014, Volume 10, Issue 3 - https://doi.org/10.2168/LMCS-10(3:9)2014
On Ramsey properties of classes with forbidden treesArticle

Authors: Jan Foniok

    Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F) by unary relations to an amalgamation class. This expanded class, enhanced with a linear ordering, has the Ramsey property.

    Volume: Volume 10, Issue 3
    Published on: August 21, 2014
    Imported on: May 30, 2012
    Keywords: Mathematics - Combinatorics,Computer Science - Discrete Mathematics
      Source : OpenAIRE Graph
    • Constraint Satisfaction Problems: Algorithms and Complexity; Funder: European Commission; Code: 257039

    1 Document citing this article

    Consultation statistics

    This page has been seen 1086 times.
    This article's PDF has been downloaded 249 times.