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

Turan and Ramsey numbers in linear triple systems

74   0   0.0 ( 0 )
 نشر من قبل Gabor Sarkozy
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




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

In this paper we study Turan and Ramsey numbers in linear triple systems, defined as $3$-uniform hypergraphs in which any two triples intersect in at most one vertex. A famous result of Ruzsa and Szemeredi is that for any fixed $c>0$ and large enough $n$ the following Turan-type theorem holds. If a linear triple system on $n$ vertices has at least $cn^2$ edges then it contains a {em triangle}: three pairwise intersecting triples without a common vertex. In this paper we extend this result from triangles to other triple systems, called {em $s$-configurations}. The main tool is a generalization of the induced matching lemma from $aba$-patterns to more general ones. We slightly generalize $s$-configurations to {em extended $s$-configurations}. For these we cannot prove the corresponding Turan-type theorem, but we prove that they have the weaker, Ramsey property: they can be found in any $t$-coloring of the blocks of any sufficiently large Steiner triple system. Using this, we show that all unavoidable configurations with at most 5 blocks, except possibly the ones containing the sail $C_{15}$ (configuration with blocks 123, 345, 561 and 147), are $t$-Ramsey for any $tgeq 1$. The most interesting one among them is the {em wicket}, $D_4$, formed by three rows and two columns of a $3times 3$ point matrix. In fact, the wicket is $1$-Ramsey in a very strong sense: all Steiner triple systems except the Fano plane must contain a wicket.



قيم البحث

اقرأ أيضاً

We call a $4$-cycle in $K_{n_{1}, n_{2}, n_{3}}$ multipartite, denoted by $C_{4}^{text{multi}}$, if it contains at least one vertex in each part of $K_{n_{1}, n_{2}, n_{3}}$. The Turan number $text{ex}(K_{n_{1},n_{2},n_{3}}, C_{4}^{text{multi}})$ $bi gg($ respectively, $text{ex}(K_{n_{1},n_{2},n_{3}},{C_{3}, C_{4}^{text{multi}}})$ $bigg)$ is the maximum number of edges in a graph $Gsubseteq K_{n_{1},n_{2},n_{3}}$ such that $G$ contains no $C_{4}^{text{multi}}$ $bigg($ respectively, $G$ contains neither $C_{3}$ nor $C_{4}^{text{multi}}$ $bigg)$. We call a $C^{multi}_4$ rainbow if all four edges of it have different colors. The ant-Ramsey number $text{ar}(K_{n_{1},n_{2},n_{3}}, C_{4}^{text{multi}})$ is the maximum number of colors in an edge-colored of $K_{n_{1},n_{2},n_{3}}$ with no rainbow $C_{4}^{text{multi}}$. In this paper, we determine that $text{ex}(K_{n_{1},n_{2},n_{3}}, C_{4}^{text{multi}})=n_{1}n_{2}+2n_{3}$ and $text{ar}(K_{n_{1},n_{2},n_{3}}, C_{4}^{text{multi}})=text{ex}(K_{n_{1},n_{2},n_{3}}, {C_{3}, C_{4}^{text{multi}}})+1=n_{1}n_{2}+n_{3}+1,$ where $n_{1}ge n_{2}ge n_{3}ge 1.$
169 - Andras Gyarfas 2018
A Berge-$K_4$ in a triple system is a configuration with four vertices $v_1,v_2,v_3,v_4$ and six distinct triples ${e_{ij}: 1le i< j le 4}$ such that ${v_i,v_j}subset e_{ij}$ for every $1le i<jle 4$. We denote by $cal{B}$ the set of Berge-$K_4$ confi gurations. A triple system is $cal{B}$-free if it does not contain any member of $cal{B}$. We prove that the maximum number of triples in a $cal{B}$-free triple system on $nge 6$ points is obtained by the balanced complete $3$-partite triple system: all triples ${abc: ain A, bin B, cin C}$ where $A,B,C$ is a partition of $n$ points with $$leftlfloor{nover 3}rightrfloor=|A|le |B|le |C|=leftlceil{nover 3}rightrceil.$$
A {em special four-cycle } $F$ in a triple system consists of four triples {em inducing } a $C_4$. This means that $F$ has four special vertices $v_1,v_2,v_3,v_4$ and four triples in the form $w_iv_iv_{i+1}$ (indices are understood $pmod 4$) where th e $w_j$s are not necessarily distinct but disjoint from ${v_1,v_2,v_3,v_4}$. There are seven non-isomorphic special four-cycles, their family is denoted by $cal{F}$. Our main result implies that the Turan number $text{ex}(n,{cal{F}})=Theta(n^{3/2})$. In fact, we prove more, $text{ex}(n,{F_1,F_2,F_3})=Theta(n^{3/2})$, where the $F_i$-s are specific members of $cal{F}$. This extends previous bounds for the Turan number of triple systems containing no Berge four cycles. We also study $text{ex}(n,{cal{A}})$ for all ${cal{A}}subseteq {cal{F}}$. For 16 choices of $cal{A}$ we show that $text{ex}(n,{cal{A}})=Theta(n^{3/2})$, for 92 choices of $cal{A}$ we find that $text{ex}(n,{cal{A}})=Theta(n^2)$ and the other 18 cases remain unsolved.
For given graphs $G$ and $F$, the Turan number $ex(G,F)$ is defined to be the maximum number of edges in an $F$-free subgraph of $G$. Foucaud, Krivelevich and Perarnau and later independently Briggs and Cox introduced a dual version of this problem w herein for a given number $k$, one maximizes the number of edges in a host graph $G$ for which $ex(G,H) < k$. Addressing a problem of Briggs and Cox, we determine the asymptotic value of the inverse Turan number of the paths of length $4$ and $5$ and provide an improved lower bound for all paths of even length. Moreover, we obtain bounds on the inverse Turan number of even cycles giving improved bounds on the leading coefficient in the case of $C_4$. Finally, we give multiple conjectures concerning the asymptotic value of the inverse Turan number of $C_4$ and $P_{ell}$, suggesting that in the latter problem the asymptotic behavior depends heavily on the parity of $ell$.
In this paper, we consider a variant of Ramsey numbers which we call complementary Ramsey numbers $bar{R}(m,t,s)$. We first establish their connections to pairs of Ramsey $(s,t)$-graphs. Using the classification of Ramsey $(s,t)$-graphs for small $s, t$, we determine the complementary Ramsey numbers $bar{R}(m,t,s)$ for $(s,t)=(4,4)$ and $(3,6)$.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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