7 research outputs found
Coloring the complements of intersection graphs of geometric figures
AbstractLet G¯ be the complement of the intersection graph G of a family of translations of a compact convex figure in Rn. When n=2, we show that χ(G¯)⩽min{3α(G)-2,6γ(G)}, where γ(G) is the size of the minimum dominating set of G. The bound on χ(G¯)⩽6γ(G) is sharp. For higher dimension we show that χ(G¯)⩽⌈2(n2-n+1)1/2⌉n-1⌈(n2-n+1)1/2⌉(α(G)-1)+1, for n⩾3. We also study the chromatic number of the complement of the intersection graph of homothetic copies of a fixed convex body in Rn
Density of Range Capturing Hypergraphs
For a finite set of points in the plane, a set in the plane, and a
positive integer , we say that a -element subset of is captured
by if there is a homothetic copy of such that ,
i.e., contains exactly elements from . A -uniform -capturing
hypergraph has a vertex set and a hyperedge set consisting
of all -element subsets of captured by . In case when and
is convex these graphs are planar graphs, known as convex distance function
Delaunay graphs.
In this paper we prove that for any , any , and any convex
compact set , the number of hyperedges in is at most , where is the number of -element
subsets of that can be separated from the rest of with a straight line.
In particular, this bound is independent of and indeed the bound is tight
for all "round" sets and point sets in general position with respect to
.
This refines a general result of Buzaglo, Pinchasi and Rote stating that
every pseudodisc topological hypergraph with vertex set has
hyperedges of size or less.Comment: new version with a tight result and shorter proo
Transversal numbers of translates of a convex body
www.elsevier.com/locate/dis