M. Scheucher

activity

20162025

most citedStrongly Monotone Drawings of Planar Graphs

11 citations · 33 across the 21 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Tight bounds on the expected number of holes in random point sets

Martin Balko, Manfred Scheucher, Pavel Valtr

For integers $d \geq 2$ and $k \geq d + 1$ , a $k$ -hole in a set $S$ of points in general position in $R^{d}$ is a $k$ -tuple of points from $S$ in convex position such that the…

cs.CG2021★ 5 cited

On Crossing-Families in Planar Point Sets

Oswin Aichholzer, Jan Kynčl, Manfred Scheucher +2

A $k$ -crossing family in a point set $S$ in general position is a set of $k$ segments spanned by points of $S$ such that all $k$ segments mutually cross. In this short note we pres…

cs.CG2021

A SAT attack on higher dimensional Erdős--Szekeres numbers

Manfred Scheucher

A famous result by Erdős and Szekeres (1935) asserts that, for all $k, d \in N$ , there is a smallest integer $n = g^{(d)} (k)$ such that every set of at least $n$ points in…