Ramsey Classes with Closure Operations (Selected Combinatorial Applications)

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10387243" target="_blank" >RIV/00216208:11320/18:10387243 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1017/9781316650295.015" target="_blank" >https://doi.org/10.1017/9781316650295.015</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1017/9781316650295.015" target="_blank" >10.1017/9781316650295.015</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Ramsey Classes with Closure Operations (Selected Combinatorial Applications)

Popis výsledku v původním jazyce

We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Nešetřil-Rödl Theorem, the author&apos;s Ramsey lift of bowtie-free graphs as well as the Ramsey Theorem for Finite Models (i.e. structures with both functions and relations) thus providing the ultimate generalisation of Structural Ramsey Theorem. We give here a more concise reformulation of recent authors paper &quot;All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)&quot; and the main purpose of this paper is to show several applications. Particularly we prove the Ramsey property of ordered sets with equivalences on the power set, Ramsey theorem for Steiner systems, Ramsey theorem for resolvable designs and a partial Ramsey type results for H-factorizable graphs. All of these results are natural, easy to state, yet proofs involve most of the theory developed.

Název v anglickém jazyce

Ramsey Classes with Closure Operations (Selected Combinatorial Applications)

Popis výsledku anglicky

We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Nešetřil-Rödl Theorem, the author&apos;s Ramsey lift of bowtie-free graphs as well as the Ramsey Theorem for Finite Models (i.e. structures with both functions and relations) thus providing the ultimate generalisation of Structural Ramsey Theorem. We give here a more concise reformulation of recent authors paper &quot;All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)&quot; and the main purpose of this paper is to show several applications. Particularly we prove the Ramsey property of ordered sets with equivalences on the power set, Ramsey theorem for Steiner systems, Ramsey theorem for resolvable designs and a partial Ramsey type results for H-factorizable graphs. All of these results are natural, easy to state, yet proofs involve most of the theory developed.

Druh

C - Kapitola v odborné knize

CEP obor

—

OECD FORD obor

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

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název knihy nebo sborníku

Connections in Discrete Mathematics

ISBN

978-1-316-65029-5

Počet stran výsledku

19

Strana od-do

240-258

Počet stran knihy

352

Název nakladatele

Cambridge University Press

Místo vydání

Neuveden

Kód UT WoS kapitoly

—