Benjamin Reiniger

activity

20112021

most citedA symplectic proof of a theorem of Franks

24 citations · 36 across the 11 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015

Dynamic coloring parameters for graphs with given genus

Sarah Loeb, Thomas Mahoney, Benjamin Reiniger +1

A proper vertex coloring of a graph $G$ is $r$ -dynamic if for each $v \in V (G)$ , at least $min {r, d (v)}$ colors appear in $N_{G} (v)$ . In this paper we investigate $r$ -dynamic versio…

math.CO2015

Chvátal-type results for degree sequence Ramsey numbers

Christopher Cox, Michael Ferrara, Ryan M. Martin +1

A sequence of nonnegative integers $π = (d_{1}, d_{2}, ..., d_{n})$ is graphic if there is a (simple) graph $G$ of order $n$ having degree sequence $π$ . In this case, $G$ is said to realize o…