اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدF-Saturation Games
102
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 show 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.
قيم البحث
اقرأ أيضاً
We study analogues of $mathcal{F}$-saturation games, first introduced by Furedi, Reimer and Seress in 1991, and named as such by West. We examine analogous games on directed graphs, and show tight results on the walk-avoiding game. We also examine an
intermediate game played on undirected graphs, such that there exists an orientation avoiding a given family of directed graphs, and show bounds on the score. This last game is shown to be equivalent to a recent game studied by Hefetz, Krivelevich, Naor and Stojakovic, and we give new bounds for bias
Given a family of graphs $mathcal{F}$, we define the $mathcal{F}$-saturation game as follows. Two players alternate adding edges to an initially empty graph on $n$ vertices, with the only constraint being that neither player can add an edge that crea
tes a subgraph in $mathcal{F}$. The game ends when no more edges can be added to the graph. One of the players wishes to end the game as quickly as possible, while the other wishes to prolong the game. We let $textrm{sat}_g(n,mathcal{F})$ denote the number of edges that are in the final graph when both players play optimally. In general there are very few non-trivial bounds on the order of magnitude of $textrm{sat}_g(n,mathcal{F})$. In this work, we find collections of infinite families of cycles $mathcal{C}$ such that $textrm{sat}_g(n,mathcal{C})$ has linear growth rate.
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 ho
w 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.
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 $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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
