Power of $k$ Choices and Rainbow Spanning Trees in Random Graphs

[摘要] We consider the Erdős-Rényi random graph process, which is a stochastic process that starts with $n$ vertices and no edges, and at each step adds one new edge chosen uniformly at random from the set of missing edges. Let $\mathcal{G}(n,m)$ be a graph with

[学科分类] 离散数学和组合数学