Peter van Hintum

activity

20182026

most citedSharp quantitative stability of the planar Brunn-Minkowski inequality

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

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2025

From Brunn-Minkowski to Prékopa-Leindler and Borell-Brascamp-Lieb: discrete inequalities

Peter van Hintum

We consider a general way to obtain Prékopa-Leindler and Borell-Brascamp-Lieb type inequalities from Brunn-Minkowski type inequalities and provide numerous examples. We use the sam…

math.CO2020

Capture times in the Bridge-burning Cops and Robbers game

Rebekah Herrman, Peter van Hintum, Stephen G. Z. Smith

In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from…

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.CO2020

Improved Bound for Tomaszewski's Problem

Vojtěch Dvořák, Peter van Hintum, Marius Tiba

In 1986, Tomaszewski made the following conjecture. Given $n$ real numbers $a_{1}, ..., a_{n}$ with $\sum_{i = 1}^{n} a_{i}^{2} = 1$ , then of the $2^{n}$ signed sums $\pm a_{1} \pm ... \p…

math.CO2020

The Eternal Game Chromatic Number of Random Graphs

Vojtěch Dvořák, Rebekah Herrman, Peter van Hintum

The eternal graph colouring problem, recently introduced by Klostermeyer and Mendoza, is a version of the graph colouring game, where two players take turns properly colouring a gr…

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,…