17 citations · 85 across the 28 of their papers we have counts for
Showing 2021 · math.COShow all
3 papers · 2 filters
math.CO2021
Tight bounds on the expected number of holes in random point sets
Martin Balko, Manfred Scheucher, Pavel Valtr
For integers and , a -hole in a set of points in general position in is a -tuple of points from in convex position such that the…
math.CO2021
On the Connectivity and the Diameter of Betweenness-Uniform Graphs
David Hartman, Aneta Pokorná, Pavel Valtr
Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have…
math.CO2021
Linear Layouts of Complete Graphs
Stefan Felsner, Laura Merker, Torsten Ueckerdt +1
A page (queue) with respect to a vertex ordering of a graph is a set of edges such that no two edges cross (nest), i.e., have their endpoints ordered in an ABAB-pattern (ABBA-patte…