论文标题
循环和集团的方向拉姆齐阈值
Orientation Ramsey thresholds for cycles and cliques
论文作者
论文摘要
如果$ g $是一个图形，而$ \ vec h $是面向的图形，我们将$ g \ to \ vec h $写成，以说$ g $的每个方向都包含$ \ vec h $作为一个子图。我们考虑$ g = g（n，p）$，二项式随机图的情况。我们确定属性$ g（n，p）\（n，p）\ to \ vec h $的阈值$ p _ {\ vec h} = p _ {\ vec h}（n）$，对于$ \ vec h $是完整图或周期的acyclicatientation的情况。
If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We determine the threshold $p_{\vec H}=p_{\vec H}(n)$ for the property $G(n,p)\to \vec H$ for the cases in which $\vec H$ is an acyclic orientation of a complete graph or of a cycle.
