Combinatorial partitions of finite posets and lattices - Ramsey lattices

From MaRDI portal
Publication:798338

DOI10.1007/BF01191498zbMath0546.06002OpenAlexW2049849006MaRDI QIDQ798338

Vojtěch Rödl, Jaroslav Nešetřil

Publication date: 1984

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01191498




Related Items (29)

A Ramsey theoretic problem for finite ordered setsUpper bounds for a Ramsey theorem for treesDistance Preserving Ramsey GraphsRamsey classes with forbidden homomorphisms and a closureSymmetry and the Ramsey degree of posetsMetric spaces are RamseyRepresenting orders on the plane by translating convex figuresSome remarks on natural orders for combinatorial cubesA dual Ramsey theorem for permutationsRamsey properties of products of chainsOn big Ramsey degrees for binary free amalgamation classesBoolean lattices: Ramsey properties and embeddingsA Ramsey class for Steiner systemsPoset Ramsey numbers: large Boolean lattice versus a fixed posetSubrecursive Complexity of Identifying the Ramsey Structure of PosetsRamsey classes of topological and metric spacesBig Ramsey degrees in universal inverse limit structuresRamsey property, ultrametric spaces, finite posets, and universal minimal flowsA Ramseyian theorem on products of treesReorientations of covering graphsChromatic number of Hasse diagrams, eyebrows and dimensionRamsey partial orders from acyclic graphsThe Ramsey and the ordering property for classes of lattices and semilatticesRamsey numbers for partially-ordered setsSEMILATTICES AND THE RAMSEY PROPERTYSome recollections on early work with Jan PelantAll those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)Complexity of diagramsFinite presentation of homogeneous graphs, posets and Ramsey classes



Cites Work


This page was built for publication: Combinatorial partitions of finite posets and lattices - Ramsey lattices