Learn More
In this paper we present a bijection between composition matrices and (2 + 2)-free posets. This bijection maps partition matrices to factorial posets, and induces a bijection from upper triangular matrices with non-negative entries having no rows or columns of zeros to unlabeled (2 + 2)-free posets. Chains in a (2 + 2)-free poset are shown to correspond to(More)
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes – a purely combinatorial one and two geometric ones. It is shown, that most of the properties, which are known to be true for coloring complexes of graphs, break down in this more general setting,(More)
  • 1