اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOrientation Ramsey thresholds for cycles and cliques
90
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
If $G$ is a graph and $vec H$ is an oriented graph, we write $Gto 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.
قيم البحث
اقرأ أيضاً
A graph $G$ is said to be $q$-Ramsey for a $q$-tuple of graphs $(H_1,ldots,H_q)$, denoted by $Gto_q(H_1,ldots,H_q)$, if every $q$-edge-coloring of $G$ contains a monochromatic copy of $H_i$ in color $i,$ for some $iin[q]$. Let $s_q(H_1,ldots,H_q)$ de
note the smallest minimum degree of $G$ over all graphs $G$ that are minimal $q$-Ramsey for $(H_1,ldots,H_q)$ (with respect to subgraph inclusion). The study of this parameter was initiated in 1976 by Burr, ErdH{o}s and Lovasz, who determined its value precisely for a pair of cliques. Over the past two decades the parameter $s_q$ has been studied by several groups of authors, the main focus being on the symmetric case, where $H_icong H$ for all $iin [q]$. The asymmetric case, in contrast, has received much less attention. In this paper, we make progress in this direction, studying asymmetric tuples consisting of cliques, cycles and trees. We determine $s_2(H_1,H_2)$ when $(H_1,H_2)$ is a pair of one clique and one tree, a pair of one clique and one cycle, and when it is a pair of two different cycles. We also generalize our results to multiple colors and obtain bounds on $s_q(C_ell,ldots,C_ell,K_t,ldots,K_t)$ in terms of the size of the cliques $t$, the number of cycles, and the number of cliques. Our bounds are tight up to logarithmic factors when two of the three parameters are fixed.
We prove that $s_r(K_k) = O(k^5 r^{5/2})$, where $s_r(K_k)$ is the Ramsey parameter introduced by Burr, ErdH{o}s and Lov{a}sz in 1976, which is defined as the smallest minimum degree of a graph $G$ such that any $r$-colouring of the edges of $G$ cont
ains a monochromatic $K_k$, whereas no proper subgraph of $G$ has this property. The construction used in our proof relies on a group theoretic model of generalised quadrangles introduced by Kantor in 1980.
The Ramsey number $r(H)$ of a graph $H$ is the minimum $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ is then the minimum number of monochromatic
copies of $H$ taken over all two-edge-colorings of $K_{r(H)}$. The study of this concept was first proposed by Harary and Prins almost fifty years ago. In a companion paper, the authors have shown that there is a positive constant $c$ such that the threshold Ramsey multiplicity for a path or even cycle with $k$ vertices is at least $(ck)^k$, which is tight up to the value of $c$. Here, using different methods, we show that the same result also holds for odd cycles with $k$ vertices.
The Ramsey number $r(H)$ of a graph $H$ is the minimum integer $n$ such that any two-coloring of the edges of the complete graph $K_n$ contains a monochromatic copy of $H$. While this definition only asks for a single monochromatic copy of $H$, it is
often the case that every two-edge-coloring of the complete graph on $r(H)$ vertices contains many monochromatic copies of $H$. The minimum number of such copies over all two-colorings of $K_{r(H)}$ will be referred to as the threshold Ramsey multiplicity of $H$. Addressing a problem of Harary and Prins, who were the first to systematically study this quantity, we show that there is a positive constant $c$ such that the threshold Ramsey multiplicity of a path or an even cycle on $k$ vertices is at least $(ck)^k$. This bound is tight up to the constant $c$. We prove a similar result for odd cycles in a companion paper.
For graphs $G$ and $H$, let $G overset{mathrm{rb}}{{longrightarrow}} H$ denote the property that for every proper edge colouring of $G$ there is a rainbow copy of $H$ in $G$. Extending a result of Nenadov, Person, v{S}kori{c} and Steger [J. Combin. T
heory Ser. B 124 (2017),1-38], we determine the threshold for $G(n,p) overset{mathrm{rb}}{{longrightarrow}} C_ell$ for cycles $C_ell$ of any given length $ell geq 4$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
