ترغب بنشر مسار تعليمي؟ اضغط هنا

A note on rainbow saturation number of paths

67   0   0.0 ( 0 )
 نشر من قبل Yongtang Shi
 تاريخ النشر 2019
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

For a fixed graph $F$ and an integer $t$, the dfn{rainbow saturation number} of $F$, denoted by $sat_t(n,mathfrak{R}(F))$, is defined as the minimum number of edges in a $t$-edge-colored graph on $n$ vertices which does not contain a dfn{rainbow copy} of $F$, i.e., a copy of $F$ all of whose edges receive a different color, but the addition of any missing edge in any color from $[t]$ creates such a rainbow copy. Barrus, Ferrara, Vardenbussche and Wenger prove that $sat_t(n,mathfrak{R}(P_ell))ge n-1$ for $ellge 4$ and $sat_t(n,mathfrak{R}(P_ell))le lceil frac{n}{ell-1} rceil cdot binom{ell-1}{2}$ for $tge binom{ell-1}{2}$, where $P_ell$ is a path with $ell$ edges. In this short note, we improve the upper bounds and show that $sat_t(n,mathfrak{R}(P_ell))le lceil frac{n}{ell} rceil cdot left({{ell-2}choose {2}}+4right)$ for $ellge 5$ and $tge 2ell-5$.



قيم البحث

اقرأ أيضاً

Let $F$ be a fixed graph. The rainbow Turan number of $F$ is defined as the maximum number of edges in a graph on $n$ vertices that has a proper edge-coloring with no rainbow copy of $F$ (where a rainbow copy of $F$ means a copy of $F$ all of whose e dges have different colours). The systematic study of such problems was initiated by Keevash, Mubayi, Sudakov and Verstraete. In this paper, we show that the rainbow Turan number of a path with $k+1$ edges is less than $left(frac{9k}{7}+2right) n$, improving an earlier estimate of Johnston, Palmer and Sarkar.
For a graph $H$, a graph $G$ is $H$-induced-saturated if $G$ does not contain an induced copy of $H$, but either removing an edge from $G$ or adding a non-edge to $G$ creates an induced copy of $H$. Depending on the graph $H$, an $H$-induced-saturate d graph does not necessarily exist. In fact, Martin and Smith (2012) showed that $P_4$-induced-saturated graphs do not exist, where $P_k$ denotes a path on $k$ vertices. Axenovich and Csik{o}s (2019) asked the existence of $P_k$-induced-saturated graphs for $k ge 5$; it is easy to construct such graphs when $kin{2, 3}$. Recently, R{a}ty constructed a graph that is $P_6$-induced-saturated. In this paper, we show that there exists a $P_{k}$-induced-saturated graph for infinitely many values of $k$. To be precise, we find a $P_{3n}$-induced-saturated graph for every positive integer $n$. As a consequence, for each positive integer $n$, we construct infinitely many $P_{3n}$-induced-saturated graphs. We also show that the Kneser graph $K(n,2)$ is $P_6$-induced-saturated for every $nge 5$.
Let $G$ be a graph of order $n$ with an edge-coloring $c$, and let $delta^c(G)$ denote the minimum color degree of $G$. A subgraph $F$ of $G$ is called rainbow if all edges of $F$ have pairwise distinct colors. There have been a lot results on rainbo w cycles of edge-colored graphs. In this paper, we show that (i) if $delta^c(G)>frac{3n-3}{4}$, then every vertex of $G$ is contained in a rainbow triangle; (ii) $delta^c(G)>frac{3n}{4}$, then every vertex of $G$ is contained in a rainbow $C_4$; and (iii) if $G$ is complete, $ngeq 8k-18$ and $delta^c(G)>frac{n-1}{2}+k$, then $G$ contains a rainbow cycle of length at least $k$. Some gaps in previous publications are also found and corrected.
Given graphs $G$ and $H$ and a positive integer $k$, the emph{Gallai-Ramsey number}, denoted by $gr_{k}(G : H)$ is defined to be the minimum integer $n$ such that every coloring of $K_{n}$ using at most $k$ colors will contain either a rainbow copy o f $G$ or a monochromatic copy of $H$. We consider this question in the cases where $G in {P_{4}, P_{5}}$. In the case where $G = P_{4}$, we completely solve the Gallai-Ramsey question by reducing to the $2$-color Ramsey numbers. In the case where $G = P_{5}$, we conjecture that the problem reduces to the $3$-color Ramsey numbers and provide several results in support of this conjecture.
We study the mixed Ramsey number maxR(n,K_m,K_r), defined as the maximum number of colours in an edge-colouring of the complete graph K_n, such that K_n has no monochromatic complete subgraph on m vertices and no rainbow complete subgraph on r vertic es. Improving an upper bound of Axenovich and Iverson, we show that maxR(n,K_m,K_4) <= n^{3/2}sqrt{2m} for all m >= 3. Further, we discuss a possible way to improve their lower bound on maxR(n,K_4,K_4) based on incidence graphs of finite projective planes.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا