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 2014Show all

3 papers · 1 filter

math.CO2014★ 2 cited

Coloring, sparseness, and girth

Noga Alon, Alexandr Kostochka, Benjamin Reiniger +2

An $r$ -augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d, g, r \in N$ , we construct a bipartite $r$ -augmented complete $d$ -ary tree havi…

math.CO2014

The Game Saturation Number of a Graph

James M. Carraher, William B. Kinnersley, Benjamin Reiniger +1

Given a family $F$ and a host graph $H$ , a graph $G \subseteq H$ is $F$ -saturated relative to $H$ if no subgraph of $G$ lies in $F$ but adding any e…

math.CO2014

Large subposets with small dimension

Benjamin Reiniger, Elyse Yeager

Dorais asked for the maximum guaranteed size of a dimension $d$ subposet of an $n$ -element poset. A lower bound of order $n$ was found by Goodwillie. We provide a sublinear…