A dual Ramsey theorem for permutations

zbMath1369.05200arXiv1702.06596MaRDI QIDQ2401425

Dragan Mašulović

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

dual Ramsey propertyfinite permutations

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Generalized Ramsey theory (05C55) Model theory of finite structures (03C13) Ramsey theory (05D10) General theory of categories and functors (18A99)

Related Items (5)

Ramsey properties of products and pullbacks of categories and the Grothendieck construction ⋮ On dual Ramsey theorems for relational structures ⋮ A new proof of the Nešetřil-Rödl theorem ⋮ Finite big Ramsey degrees in universal structures ⋮ A Ramsey theorem for multiposets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New Ramsey classes from old
• Ramsey properties of finite posets
• Ramsey properties of finite posets. II
• Combinatorial partitions of finite posets and lattices - Ramsey lattices
• Metric spaces are Ramsey
• Reconstructing permutations from identification minors
• Hereditary attributes of surjections and parameter sets
• Partitions of finite relational and set systems
• Ramsey properties of permutations
• Categorical equivalence and the Ramsey property for finite powers of a primal algebra
• Models Without Indiscernibles
• Ramsey's Theorem for n-Parameter Sets

This page was built for publication: A dual Ramsey theorem for permutations