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.
Chapter PDF
References
Edwards, A.W.F.: Seven-set Venn diagrams with rotational and polar symmetry. Combin. Probab. Comput. 7(2), 149–152 (1998)
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)
Grünbaum, B.: Venn diagrams and independent families of sets. Mathematics Magazine 48, 12–23 (1975)
Grünbaum, B.: Venn diagrams. II. Geombinatorics 2(2), 25–32 (1992)
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)
Henderson, D.W.: Venn Diagrams for More than Four Classes. Amer. Math. Monthly 70(4), 424–426 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mamakani, K., Ruskey, F. (2013). The First Simple Symmetric 11-Venn Diagram. In: Didimo, W., Patrignani, M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36763-2_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-36763-2_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36762-5
Online ISBN: 978-3-642-36763-2
eBook Packages: Computer ScienceComputer Science (R0)