The intersection graph of the disks with diameters the sides of a convex nn-gon

preprint2016arXivOpen access

Abstract

Given a convex polygon of nn sides, one can draw nn disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the nn disks and two disks are adjacent if and only if they have a point in common. We prove that for every convex polygon this graph is planar. Particularly, for n=5n=5, this shows that for any convex pentagon there are two disks among the five side disks that do not intersect, which means that K5K_5 is never the intersection graph of such five disks. For n=6n=6, we then have that for any convex hexagon the intersection graph of the side disks does not contain K3,3K_{3,3} as subgraph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.