Atlas home || Conferences | Abstracts | about Atlas

Algebraic and Topological Methods in Graph Theory
December 11-15, 2000
The University of Auckland
Auckland, New Zealand

Organizers
Dr Paul Bonnington, Prof Marston Conder, Michael Prestidge, Jamie Sneddon (sneddon@math.auckland.ac.nz), Dr Michael Dinneen

View Abstracts
Conference Homepage

Which Venn diagrams can be drawn convexly?
by
Frank Ruskey
University of Victoria and University of Newcastle (visiting)
Coauthors: Bette Bultena (U. Victoria), Branko Grunbaum (U. Washington)

An n-Venn diagram is a collection of n simple curves in the plane with the property that they divide the plane into 2n connected regions, one region per possible intersection of the interiors of the curves. A Venn diagram is convex if there is a continuous tranformation of the plane that makes all n curves convex. We give a simple necessary and sufficient condition for a Venn diagram to be convex in terms of the directed dual graph of the diagram, namely that the dual must have a unique source and a unique sink.

Date received: November 8, 2000


Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafp-07.