On ordered sets without 2-colourings

DOI10.1016/S0012-365X(98)00318-5zbMath0934.06008OpenAlexW2035692988MaRDI QIDQ1301737

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

antichainordered setfibres2-colorings

Mathematics Subject Classification ID

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

Cites Work

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

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