Abstract
We construct posets of dimension 2 with highly chromatic Hasse diagrams. This solves a previous problem by Nesetril and Trotter.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
B.Bollobás (1977) Colouring lattices, Algebra Universalis 7, 313–314.
I.Kříž (1989) A hypergraph-free construction of highly chromatic graphs without short cycles, Combinatorica 9(2), 227–229.
J.Nešetřil and V.Rödl (1979) A short proof of the existence of highly chromatic hypergraphs without short cycles, JCT B 27(2), 225–227.
J.Nešetřil and V.Rödl (1984) Combinatorial partitions of finite posets and lattices — Ramsey lattices, Algebra Universalis 19, 106–119.
Author information
Authors and Affiliations
Additional information
Communicated by D. Kelly
Rights and permissions
About this article
Cite this article
Kříž, I., Nešetřil, J. Chromatic number of Hasse diagrams, eyebrows and dimension. Order 8, 41–48 (1991). https://doi.org/10.1007/BF00385813
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00385813