Combinatorial partitions of finite posets and lattices - Ramsey lattices

DOI10.1007/BF01191498zbMath0546.06002MaRDI QIDQ798338

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

Publication date: 1984

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

zbMATH Keywords

chromatic number; finite posets; finite lattices; finite distributive lattices; Ramsey-type theorems; Hasse-diagram; partitions of lattices; point-Ramsey property

Mathematics Subject Classification ID

06A06: Partial orders, general

05A17: Combinatorial aspects of partitions of integers

06B15: Representation theory of lattices

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

Related Items

Finite presentation of homogeneous graphs, posets and Ramsey classes, Metric spaces are Ramsey, Some recollections on early work with Jan Pelant, A Ramsey theoretic problem for finite ordered sets, Representing orders on the plane by translating convex figures, Some remarks on natural orders for combinatorial cubes, A Ramseyian theorem on products of trees, Reorientations of covering graphs, Chromatic number of Hasse diagrams, eyebrows and dimension, Complexity of diagrams, Upper bounds for a Ramsey theorem for trees, Symmetry and the Ramsey degree of posets, Ramsey classes of topological and metric spaces, Subrecursive Complexity of Identifying the Ramsey Structure of Posets

Cites Work

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