Coloring Ordered Sets to Avoid Monochromatic Maximal Chains

DOI10.4153/CJM-1992-005-1MaRDI QIDQ4022850zbMATH OpenOpenAlexFDO

Authors Dwight Duffus, Vojtěch Rödl, Norbert Sauer, R. E. Woodrow

Publication date 17 January 1993

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1992-005-1

zbMATH Keywords

2-coloringinfinite posetspartition

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07)

Recommendations

• On the Complexity of Ordered Colorings
• Colouring set families without monochromatic k-chains
• On ordered sets without 2-colourings
• On a problem concerning ordered colourings
• Ordered coloring of grids and related graphs
• Coloring linear orders with Rado's partial order
• A sequential coloring algorithm for finite sets
• Orderings of uniquely colorable hypergraphs
• On monochromatic configurations for finite colorings
• Colourings without monochromatic disjoint pairs

Cited in

(12)

• A Ramsey theoretic problem for finite ordered sets
• Two-colouring all two-element maximal antichains
• Coloring chains
• On ordered sets without 2-colourings
• The complexity of the fixed point property
• Products of chains with monochromatic maximal chains and antichains
• Multicolor chain avoidance in the Boolean lattice
• Rainbow colourings of chains
• scientific article; zbMATH DE number 1506513 (Why is no real title available?)
• Betweenness of partial orders
• Chain partitions of ordered sets
• An ordered set of size \(\aleph_1\) with monochromatic maximal chains

This page was built for publication: Coloring Ordered Sets to Avoid Monochromatic Maximal Chains

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