Ramsey theorem for designs

DOI10.1016/J.ENDM.2017.07.016MaRDI QIDQ1689983zbMATHOpenAlexFDO

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

Publication date 18 January 2018

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

zbMATH Keywords

designSteiner systemhomogeneous structureRamsey class

Mathematics Subject Classification ID

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

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.

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)

Cites work

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

Cited in

(3)

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

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)