Georgia Institute of Technology School of Mathematics | Georgia Institute of Technology | Atlanta, GA

In this talk we will explore the interplay between tropical convexity and its classical counterpart. In particular, we will focus on the tropical convex hull of convex sets and polyhedral complexes. We give a vertex description of the tropical convex hull of a line segment and of a ray in Rn/R1 and show that tropical convex hull and classical convex hull commute in R3/R1. Finally, we prove results on the dimension of tropical convex fans and give an upper bound on the dimension of the tropical convex hull of tropical curves under certain hypothesis. 

An edge-colored graph $G$ is called \textit{rainbow} if every edge of $G$ receives a different color. The \textit{anti-Ramsey} number of $t$ edge-disjoint rainbow spanning trees, denoted by $r(n,t)$, is defined as the maximum number of colors in an edge-coloring of $K_n$ containing no $t$ edge-disjoint rainbow spanning trees. Jahanbekam and West [{\em J. Graph Theory, 2016}] conjectured that for any fixed $t$, $r(n,t)=\binom{n-2}{2}+t$ whenever $n\geq 2t+2 \geq 6$. We show their conjecture is true and also determine $r(n,t)$ when $n = 2t+1$. Together with previous results, this gives the anti-Ramsey number of $t$ edge-disjoint rainbow spanning trees for all values of $n$ and $t$. Joint work with Linyuan Lu.