Lauren M. Nelsen

activity

20152018

most citedMany edge-disjoint rainbow spanning trees in general graphs

4 citations · 5 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2018

Erdős-Szekeres On-Line

Kirk Boyer, Lauren M. Nelsen, Luke L. Nelsen +3

In 1935, Erdős and Szekeres proved that $(m - 1) (k - 1) + 1$ is the minimum number of points in the plane which definitely contain an increasing subset of $m$ points or a decreasing subs…

math.CO2017★ 4 cited

Many edge-disjoint rainbow spanning trees in general graphs

Paul Horn, Lauren M. Nelsen

A rainbow spanning tree in an edge-colored graph is a spanning tree in which each edge is a different color. Carraher, Hartke, and Horn showed that for $n$ and $C$ large enough, if…

math.CO2015★ 1 cited

Color-blind index in graphs of very low degree

Jennifer Diemunsch, Nathan Graber, Lucas Kramer +6

Let $c : E (G) \to [k]$ be an edge-coloring of a graph $G$ , not necessarily proper. For each vertex $v$ , let $c ˉ (v) = (a_{1}, \dots, a_{k})$ , where $a_{i}$ is the number of edges incident…