Combinatorial partitions of finite posets and lattices - Ramsey lattices

DOI10.1007/BF01191498MaRDI QIDQ798338zbMATH OpenOpenAlexFDO

Authors Vojtěch Rödl, J. 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

zbMATH Keywords

chromatic numberfinite posetsfinite latticesfinite distributive latticesRamsey-type theoremsHasse-diagrampartitions of latticespoint-Ramsey property

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial aspects of partitions of integers (05A17) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Representation theory of lattices (06B15)

Recommendations

• On the dual Ramsey property for finite distributive lattices
• scientific article; zbMATH DE number 1506513
• The Ramsey and the ordering property for classes of lattices and semilattices
• Chain partitions of ordered sets
• Symmetry and the Ramsey degree of posets

Cites work

• A short proof of the existence of highly chromatic hypergraphs without short cycles
• On chromatic number of finite set-systems
• On chromatic number of graphs and set-systems
• Recent results in partition (Ramsey) theory for finite lattices
• Regularity and Positional Games
• Selective Graphs and Hypergraphs

Cited in

(34)

• Upper bounds for a Ramsey theorem for trees
• Reorientations of covering graphs
• Purely chromatic and hyper chromatic lattices
• Ramsey numbers for partially-ordered sets
• A dual Ramsey theorem for permutations
• Subrecursive Complexity of Identifying the Ramsey Structure of Posets
• Metric spaces are Ramsey
• Finite presentation of homogeneous graphs, posets and Ramsey classes
• Ramsey properties of products of chains
• Semilattices and the Ramsey property
• scientific article; zbMATH DE number 1159818 (Why is no real title available?)
• scientific article; zbMATH DE number 1506513 (Why is no real title available?)
• Counting complements in the partition lattice, and hypertrees
• Representing orders on the plane by translating convex figures
• Poset Ramsey numbers: large Boolean lattice versus a fixed poset
• Distance preserving Ramsey graphs
• Complexity of diagrams
• A Ramsey class for Steiner systems
• Chromatic number of Hasse diagrams, eyebrows and dimension
• Ramsey classes of topological and metric spaces
• Ramsey property, ultrametric spaces, finite posets, and universal minimal flows
• A Ramseyian theorem on products of trees
• On big Ramsey degrees for binary free amalgamation classes
• Ramsey partial orders from acyclic graphs
• Big Ramsey degrees in universal inverse limit structures
• Some remarks on natural orders for combinatorial cubes
• Symmetry and the Ramsey degree of posets
• Combinatorics arising from lax colimits of posets
• Ramsey classes with forbidden homomorphisms and a closure
• Some recollections on early work with Jan Pelant
• A Ramsey theoretic problem for finite ordered sets
• Boolean lattices: Ramsey properties and embeddings
• The Ramsey and the ordering property for classes of lattices and semilattices
• All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)

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

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