T. Short

activity

20182022

collaborators

3 papers

math.CO2022

Every subcubic multigraph is $(1, 2^{7})$ -packing edge-colorable

Xujun Liu, Michael Santana, Taylor Short

For a non-decreasing sequence $S = (s_{1}, \dots, s_{k})$ of positive integers, an $S$ -packing edge-coloring of a graph $G$ is a decomposition of edges of $G$ into disjoint sets $E_1,…

math.CO2019

Independent Sets in n-vertex k-chromatic, \ell-connected graphs

John Engbers, Lauren Keough, Taylor Short

We study the problem of maximizing the number of independent sets in $n$ -vertex $k$ -chromatic $ℓ$ -connected graphs. First we consider maximizing the total number of independent…

math.CO2018

The saturation number of carbon nanocones and nanotubes

Taylor Short

The saturation number of a graph is the cardinality of a smallest maximal matching. This paper presents bounds for the saturation number of carbon nanocones which are asymptoticall…

Every subcubic multigraph is (1,27)-packing edge-colorable

Independent Sets in n-vertex k-chromatic, \ell-connected graphs

The saturation number of carbon nanocones and nanotubes

Every subcubic multigraph is $(1, 2^{7})$ -packing edge-colorable