Peter van Hintum

most citedSharp quantitative stability of the planar Brunn-Minkowski inequality

1 citations · 1 across the 2 of their papers we have counts for

collaborators

4 papers

math.CO2020

Radius, Girth and Minimum Degree

Vojtěch Dvořák, Peter van Hintum, Amy Shaw +1

Given a connected graph $G$ on $n$ vertices, with minimum degree $δ \geq 2$ and girth at least $g \geq 4$ , what is the maximum radius $r$ this graph can have? Erdős, Pach, Pollack a…

math.CO2019

(t,r) broadcast domination in the infinite grid

Rebekah Herrman, Peter van Hintum

The $(t, r)$ broadcast domination number of a graph $G$ , $γ_{t, r} (G)$ , is a generalization of the domination number of a graph. $γ_{t, r} (G)$ is the minimal number of towers needed,…

math.FA2019★ 1 cited

Sharp quantitative stability of the planar Brunn-Minkowski inequality

Peter van Hintum, Hunter Spink, Marius Tiba

We prove a sharp stability result for the Brunn-Minkowski inequality for $A, B \subset R^{2}$ . Assuming that the Brunn-Minkowski deficit $δ=|A+B|^{\frac{1}{2}}/(|A|^\frac12+|B|…

math.MG2019

Sharp Stability of Brunn-Minkowski for Homothetic Regions

Peter van Hintum, Hunter Spink, Marius Tiba

We prove a sharp stability result concerning how close homothetic sets attaining near-equality in the Brunn-Minkowski inequality are to being convex. In particular, resolving a con…