Josiah Reiswig

collaborators

3 papers

math.CO2019

The Steiner distance problem for large vertex subsets in the hypercube

Éva Czabarka, Josiah Reiswig, László Székely

We find the asymptotic behavior of the Steiner k-diameter of the $n$ -cube if $k$ is large. Our main contribution is the lower bound, which utilizes the probabilistic method.

math.CO2019

The Steiner $k$ -radius and Steiner $k$ -diameter of connected graphs for $k \geq 4$

Josiah Reiswig

Given a connected graph $G = (V, E)$ and a vertex set $S \subset V$ , the {\em Steiner distance} $d (S)$ of $S$ is the size of a minimum spanning tree of $S$ in $G$ . For a connected grap…

math.CO2018

Midrange crossing constants for graphs classes

Éva Czabarka, Josiah Reiswig, László Székely +1

For positive integers $n$ and $e$ , let $κ (n, e)$ be the minimum crossing number (the standard planar crossing number) taken over all graphs with $n$ vertices and at least $e$ edges.…

The Steiner distance problem for large vertex subsets in the hypercube

The Steiner k-radius and Steiner k-diameter of connected graphs for k≥4

Midrange crossing constants for graphs classes

The Steiner $k$ -radius and Steiner $k$ -diameter of connected graphs for $k \geq 4$