Finite convex geometries of circles

Citations of this article
Mendeley users who have this article in their library.


Let F be a finite set of circles in the plane. The usual convex closure restricted to F yields a convex geometry, which is a combinatorial structure introduced by P. H. Edelman in 1980 under the name "anti-exchange closure system". We prove that if the circles are collinear and they are arranged in a "concave way", then they determine a convex geometry of convex dimension at most 2, and each finite convex geometry of convex dimension at most 2 can be represented this way. The proof uses some recent results from lattice theory, and some of the auxiliary statements on lattices or convex geometries could be of separate interest. The paper concludes with some open problems. © 2014 Elsevier B.V. All rights reserved.




Czédli, G. (2014). Finite convex geometries of circles. Discrete Mathematics, 330, 61–75.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free