On ordered sets without 2-colourings

DOI10.1016/S0012-365X(98)00318-5MaRDI QIDQ1301737zbMATH OpenOpenAlexFDO

Authors Zbigniew Lonc

Publication date 12 September 1999

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00318-5

zbMATH Keywords

2-coloringsantichainfibresordered set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorics of partially ordered sets (06A07)

Recommendations

• Coloring Ordered Sets to Avoid Monochromatic Maximal Chains
• A Ramsey theoretic problem for finite ordered sets
• On graphs that can be oriented as diagrams of ordered sets
• Two-colouring all two-element maximal antichains

Cites work

• A smallest-fibre-size to poset-size ratio approaching \({8 \over 15}\)
• Chains, antichains, and fibres
• Clique-transversal sets of line graphs and complements of line graphs
• Covering all cliques of a graph
• Covering the cliques of a graph with vertices
• Fibres and ordered set coloring
• Fibres of width 3 ordered sets
• Two-colouring all two-element maximal antichains

Cited in

(2)

• Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets
• Coloring Ordered Sets to Avoid Monochromatic Maximal Chains

This page was built for publication: On ordered sets without 2-colourings

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