Half-simple symmetric Venn diagrams
Summary: A Venn diagram is simple if at most two curves intersect at any given point. A recent paper of \textit{J. Griggs} et al. [Electron. J. Comb., Research paper R2 (2004; Zbl 1034.06001)] shows how to construct rotationally symmetric Venn diagrams for any prime number of curves. However, the resulting diagrams contain only \({n \choose {\lfloor n/2 \rfloor}}\) intersection points, whereas a simple Venn diagram contains \(2^n-2\) intersection points. We show how to modify their construction to give symmetric Venn diagrams with asymptotically at least \(2^{n-1}\) intersection points, whence the name ``half-simple.
- Generating simple convex Venn diagrams
- On the central levels problem
- Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
- scientific article; zbMATH DE number 1275585 (Why is no real title available?)
- Symmetric $11$-Venn diagrams with vertex sets $231, 242,...,352$
- The first simple symmetric 11-Venn diagram
- The search for simple symmetric Venn diagrams
- New roses: simple symmetric Venn diagrams with 11 and 13 curves
- More fun with symmetric Venn diagrams
This page was built for publication: Half-simple symmetric Venn diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773162)
