Tag Archives: Geometric combinatorics

A Discrepancy Problem for Planar Configurations

Yaacov Kupitz and Micha A. Perles asked: What is the smallest number C such that for every configuration of n points in the plane there is a line containing two or more points from the configuration for which the difference between the … Continue reading

Posted in Combinatorics | Tagged , | Leave a comment

Extermal Combinatorics II: Some Geometry and Number Theory

Extremal problems in additive number theory Our first lecture dealt with extremal problems for families of sets. In this lecture we will consider extremal problems for sets of real numbers, and for geometric configurations in planar Euclidean geometry.  Problem I: Given a set A of … Continue reading

Posted in Combinatorics, Open problems | Tagged , , | 2 Comments