{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T22:23:22Z","timestamp":1773872602478,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A Venn diagram is simple if at most two curves intersect at any given point.  A recent paper of Griggs, Killian, and Savage [Elec. J. Combinatorics, Research Paper 2, 2004] 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.\"<\/jats:p>","DOI":"10.37236\/1839","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T21:31:03Z","timestamp":1578691863000},"source":"Crossref","is-referenced-by-count":4,"title":["Half-Simple Symmetric Venn Diagrams"],"prefix":"10.37236","volume":"11","author":[{"given":"Charles E.","family":"Killian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Ruskey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla D.","family":"Savage","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Weston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2004,11,30]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v11i1r86\/comment","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v11i1r86\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:52:34Z","timestamp":1579305154000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v11i1r86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11,30]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2004,1,2]]}},"URL":"https:\/\/doi.org\/10.37236\/1839","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,11,30]]},"article-number":"R86"}}