The First Simple Symmetric 11-Venn Diagram

  • Khalegh Mamakani
  • Frank Ruskey
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7704)

Abstract

An n-Venn diagram is a collection of n simple closed curves in the plane with the following properties: (a) Each of the 2n 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.

References

  1. 1.
    Edwards, A.W.F.: Seven-set Venn diagrams with rotational and polar symmetry. Combin. Probab. Comput. 7(2), 149–152 (1998)MathSciNetMATHCrossRefGoogle Scholar
  2. 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
  3. 3.
    Grünbaum, B.: Venn diagrams and independent families of sets. Mathematics Magazine 48, 12–23 (1975)MATHCrossRefGoogle Scholar
  4. 4.
    Grünbaum, B.: Venn diagrams. II. Geombinatorics 2(2), 25–32 (1992)MathSciNetMATHGoogle Scholar
  5. 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
  6. 6.
    Henderson, D.W.: Venn Diagrams for More than Four Classes. Amer. Math. Monthly 70(4), 424–426 (1963)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Khalegh Mamakani
    • 1
  • Frank Ruskey
    • 1
  1. 1.Dept. of Computer ScienceUniversity of VictoriaCanada

Personalised recommendations