Combinatorial partitions of finite posets and lattices - Ramsey lattices

DOI10.1007/BF01191498zbMATH Open0546.06002OpenAlexW2049849006MaRDI QIDQ798338FDOQ798338

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

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

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)

Cites Work

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

Cited In (33)

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

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)