## $k$-separated matching and edge coloring numbers in sparse random graphs

- Sept. 30, 2013
- 3:15 p.m.
- LeConte 312

## Abstract

In this talk, we mainly use some basic probabilistic techniques to consider the lower and upper bounds for the random variables, the size of the maximum $k$-seperated matching and the minimum distance edge coloring number for any positive integer $k\geq3$ in sparse random graph $G _ {n,p}$ with $p=p(n)=c/n$ for some sufficiently large constant $c$.