|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|5777470||1413664||2018||27 صفحه PDF||ندارد||دانلود کنید|
We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general r-uniform hypergraphs, it turns out that simply putting linear orders on their sets of vertices is not enough for this purpose: one also has to strengthen the notion of subobjects used from âinduced subsystemsâ to something we call âstrongly induced subsystemsâ.Moreover we study the Ramsey properties of other classes of Steiner systems obtained from this class by either forgetting the order or by working with the usual notion of subsystems. This leads to a perhaps surprising induced Ramsey theorem in which designs get coloured.
Journal: Journal of Combinatorial Theory, Series A - Volume 154, February 2018, Pages 323-349