Ramsey theorem for designs

DOI10.1016/J.ENDM.2017.07.016zbMATH Open1379.05118arXiv1705.02989OpenAlexW2613499544MaRDI QIDQ1689983FDOQ1689983

Authors: Jan Hubička, J. Nešetřil 

Publication date: 18 January 2018

Abstract: We prove that for any choice of parameters $k,t,lambda$ the class of all finite ordered designs with parameters $k,t,lambda$ is a Ramsey class.

Full work available at URL: https://arxiv.org/abs/1705.02989

Recommendations

• A Ramsey class for Steiner systems
• Ramsey class with closure operations (selected combinatorial applications)
• Ramsey partial orders from acyclic graphs
• A Ramsey theorem for partial orders with linear extensions
• All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

zbMATH Keywords

designSteiner systemhomogeneous structureRamsey class

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Ramsey theory (05D10)

Cites Work

• Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
• Title not available (Why is that?)
• The Ramsey property for graphs with forbidden complete subgraphs
• Universal graphs with forbidden subgraphs and algebraic closure
• Bowtie-free graphs have a Ramsey lift
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

Cited In (3)

• Mono-multi bipartite Ramsey numbers, designs, and matrices
• A Ramsey class for Steiner systems
• A combinatorial proof of the extension property for partial isometries

This page was built for publication: Ramsey theorem for designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689983)