Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Chromatic number of Hasse diagrams, eyebrows and dimension

Abstract

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.

References

  1. 1.

    B.Bollobás (1977) Colouring lattices, Algebra Universalis 7, 313–314.

  2. 2.

    I.Kříž (1989) A hypergraph-free construction of highly chromatic graphs without short cycles, Combinatorica 9(2), 227–229.

  3. 3.

    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.

  4. 4.

    J.Nešetřil and V.Rödl (1984) Combinatorial partitions of finite posets and lattices — Ramsey lattices, Algebra Universalis 19, 106–119.

Download references

Author information

Additional information

Communicated by D. Kelly

Rights and permissions

Reprints 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

Download citation

AMS subject classifications (1991)

  • 05C15
  • 05C20
  • 06A06

Key words

  • Chromatic number
  • partially ordered sets
  • dimension
  • Hasse diagrams