Monochromatic and heterochromatic subgraph problems in a randomly colored graph

Simple item page
dc.creatorLi, Xueliang
dc.creatorZheng, Jie
dc.date2007-11-24
dc.date.accessioned2026-07-07T08:44:50Z
dc.date.available2026-07-07T08:44:50Z
dc.descriptionLet $K_n$ be the complete graph with $n$ vertices and $c_1, c_2, ..., c_r$ be $r$ different colors. Suppose we randomly and uniformly color the edges of $K_n$ in $c_1, c_2, ..., c_r$. Then we get a random graph, denoted by $\mathcal{K}_n^r$. In the paper, we investigate the asymptotic properties of several kinds of monochromatic and heterochromatic subgraphs in $\mathcal{K}_n^r$. Accurate threshold functions in some cases are also obtained.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/0711.3827
dc.identifierhttp://arxiv.org/abs/0711.3827
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142800
dc.subjectCombinatorics
dc.subject05C80; 05C15
dc.titleMonochromatic and heterochromatic subgraph problems in a randomly colored graph
dc.typetext

Files

Collections

arXiv