The First Simple Symmetric 11-Venn Diagram
An n-Venn diagram is a collection of n simple closed curves in the plane with the following properties: (a) Each of the 2 n different intersections of the open interiors or exteriors of the curves is a non-empty connected region; (b) there are only finitely many points where the curves intersect. If each of the intersections is of only two curves, then the diagram is said to be simple. The purpose of this poster is to highlight how we discovered the first simple symmetric 11-Venn diagram.
KeywordsVenn Diagram Dual Graph Span Subgraph Boolean Lattice Independent Family
- 2.Griggs, J., Killian, C.E., Savage, C.D.: Venn diagrams and symmetric chain decompositions in the Boolean lattice. Electron. J. Combin. 11(1), Research Paper 2, 30 (electronic) (2004)Google Scholar
- 5.Hamburger, P.: Doodles and doilies, non-simple symmetric Venn diagrams. Discrete Math. 257(2-3), 423–439 (2002), kleitman and combinatorics: a celebration (Cambridge, MA, 1999)Google Scholar