Chromatic number of Hasse diagrams, eyebrows and dimension

DOI10.1007/BF00385813zbMath0757.05053OpenAlexW2312794466MaRDI QIDQ1182040

Jaroslav Nešetřil, Igor Kriz

Publication date: 27 June 1992

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00385813

zbMATH Keywords

posetschromatic numberHasse diagramseyebrows

Mathematics Subject Classification ID

Partial orders, general (06A06) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

Constructing colorings for diagrams ⋮ Coloring Axis-Parallel Rectangles ⋮ Covering line graphs with equivalence relations ⋮ Separability, boxicity, and partial orders ⋮ Coloring Hasse diagrams and disjointness graphs of curves ⋮ Coloring Delaunay-edges and their generalizations ⋮ On the minimum number of completely 3-scrambling permutations ⋮ Coloring axis-parallel rectangles ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles ⋮ Incidence posets and cover graphs ⋮ Coloring geometric range spaces ⋮ Hasse diagrams with large chromatic number ⋮ Line directionality of orders

Cites Work

• Combinatorial partitions of finite posets and lattices - Ramsey lattices
• A hypergraph-free construction of highly chromatic graphs without short cycles
• Colouring lattices
• A short proof of the existence of highly chromatic hypergraphs without short cycles