A Ramsey theoretic problem for finite ordered sets

DOI10.1016/0012-365X(87)90009-4zbMath0613.06001MaRDI QIDQ1088690

William T. jun. Trotter, Henry A. Kierstead

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

width2-coloringmonochromaticfinite ordered sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (8)

Boolean lattices: Ramsey properties and embeddings ⋮ Poset Ramsey numbers: large Boolean lattice versus a fixed poset ⋮ The Boolean rainbow Ramsey number of antichains, Boolean posets and chains ⋮ A Ramseyian theorem on products of trees ⋮ Fibres and ordered set coloring ⋮ Ramsey numbers for partially-ordered sets ⋮ A Ramsey type problem concerning vertex colourings ⋮ Rainbow Ramsey problems for the Boolean lattice

Cites Work

• Combinatorial partitions of finite posets and lattices - Ramsey lattices

This page was built for publication: A Ramsey theoretic problem for finite ordered sets