论文信息 - A Symmetrical Beauty. A Non-simple 7-Venn Diagram With A Minimum Vertex Set

A Symmetrical Beauty. A Non-simple 7-Venn Diagram With A Minimum Vertex Set

In this short note using the method developed in [10] and [11], we construct a highly symmetrical, non-simple, attractive 7-Venn diagram. This diagram has the minimum number of vertices, 21. The only similar two, published in [1] and [11], di er from ours in many ways. One of them was found by computer search ([1]). Both of them are "necklace" type Venn diagrams (see [14] for de nition), but ours is not.

Peter Hamburger | Raymond E. Pippert | R. E. Pippert | P. Hamburger

[1] A. W. F. Edwards,et al. Seven-Set Venn Diagrams with Rotational and Polar Symmetry , 1998, Combinatorics, Probability and Computing.

[2] Frank Ruskey,et al. Venn Diagrams with Few Vertices , 1998, Electron. J. Comb..

[3] Peter Hamburger,et al. Venn diagrams and planar graphs , 1996 .

[4] Timothy Chambers. On Venn diagrams , 2004 .

[5] Branko Grünbaum. Venn Diagrams and Independent Families of Sets. , 1975 .

[6] David W. Henderson,et al. Venn Diagrams for More than Four Classes , 1963 .