We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...