#### Filter Results:

#### Publication Year

1978

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The following equivalent results in the Boolean lattice 2 are proven. (a) Every fibre of 2 contains a maximal chain. (b) Every cutset of 2 contains a maximal antichain. (c) Every red-blue colouring of the vertices of 2 produces either a red maximal chain or a blue maximal antichain. (d) Given any n antichains in 2 there is a disjoint maximal antichain.… (More)

We discuss Hedetniemi's conjecture in the context of categories of relational structures under homomorphisms. In this language Hedetniemi's conjecture says that if there are no homomor-phisms from the graphs G and H to the complete graph on n vertices then there is no homomorphism from G x H to the complete graph. If an object in some category has just this… (More)

Let L be a finite distributive lattice, and let J(L) denote the set of all join-irreducible elements of L. Set j(L) = IJ(Z)l. For each a C J(L), let u(a) denote the number of elements in the prime filter {x C L: x >~a}. Our main theorem is Theorem 1. For any finite distributive lattice L, 4 "(a) ~>j(L)41q ,'2. The base 4 here can most likely be replaced by… (More)

- Dwight Duffus, Vojtech Rodl, Bill Sands, Norbert Sauer, Vojtěch Rödl
- 2005

We consider the problem of determining the minimum chromatic number of graphs and hypergraphs of large girth which cannot be mapped under a homomor-phism to a specified graph or hypergraph. More generally, we are interested in large girth hypergraphs that do not admit a vertex partition of specified size such that the subhypergraphs induced by the partition… (More)