Which \(n\)-Venn diagrams can be drawn with convex \(k\)-gons? (Q2369930): Difference between revisions

The main contribution is the inequality \(k\geq (2^n-2-n)/(n(n-2))\) valid for any simple \(n\)-Venn diagram composed of convex \(k\)-gons. Without the term \(n\) on numerator, this lower bound for the number of sides required for the component curves of simple Venn diagrams is due to \textit{B. Grünbaum} [Math. Mag. 48, 12--23 (1975; Zbl 0305.05004)]. It is also shown that no (simple or not) 7-Venn diagram is composed of triangles. With the help of a software tool it is exhibited a simple, symmetric 7-Venn diagram constructed of seven quadrilaterals. The questions whether the bound given in this paper is tight for \(n>7\) or whether it also holds for non-simple diagrams are open.