论文信息 - Chromatic number of Hasse diagrams, eyebrows and dimension - 字舞流文

Chromatic number of Hasse diagrams, eyebrows and dimension

We construct posets of dimension 2 with highly chromatic Hasse diagrams. This solves a previous problem by Nesetril and Trotter.

Jaroslav Nešetřil | Igor Kříž

[1] Vojtech Rödl,et al. A short proof of the existence of highly chromatic hypergraphs without short cycles , 1979, J. Comb. Theory, Ser. B.

[2] Vojtěch Rödl,et al. Combinatorial partitions of finite posets and lattices —Ramsey lattices , 1984 .

[3] Igor Kríz,et al. Ahypergraph-free construction of highly chromatic graphs without short cycles , 1989, Comb..