اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPartite Saturation Problems
126
0
0.0
(
0
)
تأليف
Barnaby Roberts
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We look at several saturation problems in complete balanced blow-ups of graphs. We let $H[n]$ denote the blow-up of $H$ onto parts of size $n$ and refer to a copy of $H$ in $H[n]$ as partite if it has one vertex in each part of $H[n]$. We then ask how few edges a subgraph $G$ of $H[n]$ can have such that $G$ has no partite copy of $H$ but such that the addition of any new edge from $H[n]$ creates a partite $H$. When $H$ is a triangle this value was determined by Ferrara, Jacobson, Pfender, and Wenger. Our main result is to calculate this value for $H=K_4$ when $n$ is large. We also give exact results for paths and stars and show that for $2$-connected graphs the answer is linear in $n$ whilst for graphs which are not $2$-connected the answer is quadratic in $n$. We also investigate a similar problem where $G$ is permitted to contain partite copies of $H$ but we require that the addition of any new edge from $H[n]$ creates an extra partite copy of $H$. This problem turns out to be much simpler and we attain exact answers for all cliques and trees.
قيم البحث
اقرأ أيضاً
Let $mathcal{C}$ be a family of edge-colored graphs. A $t$-edge colored graph $G$ is $(mathcal{C}, t)$-saturated if $G$ does not contain any graph in $mathcal{C}$ but the addition of any edge in any color in $[t]$ creates a copy of some graph in $mat
hcal{C}$. Similarly to classical saturation functions, define $mathrm{sat}_t(n, mathcal{C})$ to be the minimum number of edges in a $(mathcal{C},t)$ saturated graph. Let $mathcal{C}_r(H)$ be the family consisting of every edge-colored copy of $H$ which uses exactly $r$ colors. In this paper we consider a variety of colored saturation problems. We determine the order of magnitude for $mathrm{sat}_t(n, mathcal{C}_r(K_k))$ for all $r$, showing a sharp change in behavior when $rgeq binom{k-1}{2}+2$. A particular case of this theorem proves a conjecture of Barrus, Ferrara, Vandenbussche, and Wenger. We determine $mathrm{sat}_t(n, mathcal{C}_2(K_3))$ exactly and determine the extremal graphs. Additionally, we document some interesting irregularities in the colored saturation function.
In 1964, ErdH{o}s, Hajnal and Moon introduced a saturation version of Turans classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a $K_r$-free, $n$-vertex graph with the property that the addition
of any further edge yields a copy of $K_r$. We consider analogues of this problem in other settings. We prove a saturation version of the ErdH{o}s-Szekeres theorem about monotone subsequences and saturati
The ErdH{o}s-Simonovits stability theorem states that for all epsilon >0 there exists alpha >0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - alpha n^2, then one can remove epsilon n^2 edges from G to obtain an r-par
tite graph. Furedi gave a short proof that one can choose alpha=epsilon. We give a bound for the relationship of alpha and varepsilon which is asymptotically sharp as epsilon to 0.
We study F-saturation games, first introduced by Furedi, Reimer and Seress in 1991, and named as such by West. The main question is to determine the length of the game whilst avoiding various classes of graph, playing on a large complete graph. We sh
ow lower bounds on the length of path-avoiding games, and more precise results for short paths. We show sharp results for the tree avoiding game and the star avoiding game.
By using the Szemeredi Regularity Lemma, Alon and Sudakov recently extended the classical Andrasfai-Erd~os-Sos theorem to cover general graphs. We prove, without using the Regularity Lemma, that the following stronger statement is true. Given any (r-
1)-partite graph H whose smallest part has t vertices, and any fixed c>0, there exists a constant C such that whenever G is an n-vertex graph with minimum degree at least ((3r-4)/(3r-1)+c)n, either G contains H, or we can delete at most Cn^(2-1/t) edges from G to yield an r-partite graph.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
