The First Simple Symmetric 11-Venn Diagram

Mamakani, Khalegh and Ruskey, Frank (2013) The First Simple Symmetric 11-Venn Diagram. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 563-565 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_54).

Full text not available from this repository.

Abstract

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.

Item Type:Conference Poster
Additional Information:10.1007/978-3-642-36763-2_54
Classifications:J Applications > J.999 Others
Z Theory > Z.999 Others
ID Code:1347

Repository Staff Only: item control page

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) CrossRef

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)