Ramsey Classes with Closure Operations (Selected Combinatorial Applications)
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Ramsey Classes with Closure Operations (Selected Combinatorial Applications)
Original language description
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'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 "All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)" 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.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
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
Book/collection name
Connections in Discrete Mathematics
ISBN
978-1-316-65029-5
Number of pages of the result
19
Pages from-to
240-258
Number of pages of the book
352
Publisher name
Cambridge University Press
Place of publication
Neuveden
UT code for WoS chapter
—