András Gyárfás: Two Ramsey problems on vertex-ordered complete graphs inspired by twisted drawings
Gyárfás AndrásBBC+G Seminar
on 11/4/22
Given a finite point set in , and we say that a point set in is a weak -net if it pierces every convex set with . Let . We show that for any finite point set in , and any , there exists a weak -net of cardinality , where is an arbitrary small constant. This is the first improvement of the bound of that was obtained in 1994 by Chazelle, Edelsbrunner, Grini, Guibas, Sharir, and Welzl for general point sets in dimension .