We construct posets of dimension 2 with highly chromatic Hasse diagrams. This solves a previous problem by Nesetril and Trotter.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
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.
Communicated by D. Kelly
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
AMS subject classifications (1991)
- Chromatic number
- partially ordered sets
- Hasse diagrams