venn diagrams are tools used to represent relationships among sets. they are easy to understand but can be difficult to draw if they involve more than three sets. the quest for a method to construct symmetric venn diagrams has led to some interesting theorems about partially ordered sets. we describe several of these theorems, their relationship to venn diagrams, and a conjecture that unifies this research.