Gerard J. Chang
YOU?
Author Swipe
View article: A Short Derivation for Turán Numbers of Paths
A Short Derivation for Turán Numbers of Paths Open
This paper gives a short derivation for a result by Faudree and Schelp that the Turán number $\\operatorname{ex}(n;P_{k+1})$ of a path of $k+1$ vertices is equal to $q \\binom{k}{2} + \\binom{r}{2}$, where $n = qk+r$ and $0 \\leq r \\lt k$…
View article: From Edge-Coloring to Strong Edge-Coloring
From Edge-Coloring to Strong Edge-Coloring Open
In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: $k$-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian. In this coloring, the set $S(v)$ of colors used by edges inciden…