All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Ramsey properties and extending partial automorphisms forhbox classes of finite structures

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10421815" target="_blank" >RIV/00216208:11320/21:10421815 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=qO-95PhlTQ" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=qO-95PhlTQ</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4064/fm560-8-2020" target="_blank" >10.4064/fm560-8-2020</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Ramsey properties and extending partial automorphisms forhbox classes of finite structures

  • Original language description

    We show that every free amalgamation class of finite structures with relations and (set-valued) functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the Nešetřil-Rödl Theorem and the second and third authors&apos; Ramsey Theorem for finite models (that is, structures with both relations and functions). We also find subclasses with the ordering property. For languages with relational symbols and unary functions we also show the extension property for partial automorphisms (EPPA) of free amalgamation classes. These general results solve several conjectures and provide an easy Ramseyness test for many classes of structures.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GJ18-13685Y" target="_blank" >GJ18-13685Y: Model thoery and extremal combinatorics</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Fundamenta Mathematicae

  • ISSN

    0016-2736

  • e-ISSN

  • Volume of the periodical

    Neuveden

  • Issue of the periodical within the volume

    253

  • Country of publishing house

    PL - POLAND

  • Number of pages

    33

  • Pages from-to

    121-153

  • UT code for WoS article

    000613910300001

  • EID of the result in the Scopus database

    2-s2.0-85108145071