اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
86
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We say a graph $G$ has a Hamiltonian path if it has a path containing all vertices of $G$. For a graph $G$, let $sigma_2(G)$ denote the minimum degree sum of two nonadjacent vertices of $G$; restrictions on $sigma_2(G)$ are known as Ore-type conditions. Given an integer $tgeq 5$, we prove that if a connected graph $G$ on $n$ vertices satisfies $sigma_2(G)>{t-3over t-2}n$, then $G$ has either a Hamiltonian path or an induced subgraph isomorphic to $K_{1, t}$. Moreover, we characterize all $n$-vertex graphs $G$ where $sigma_2(G)={t-3over t-2}n$ and $G$ has neither a Hamiltonian path nor an induced subgraph isomorphic to $K_{1, t}$. This is an analogue of a recent result by Mom`ege, who investigated the case when $t=4$.
قيم البحث
اقرأ أيضاً
Komlos [Tiling Turan theorems, Combinatorica, 20,2 (2000), 203{218] determined the asymptotically optimal minimum degree condition for covering a given proportion of vertices of a host graph by vertex-disjoint copies of a fixed graph. We show that th
e minimum degree condition can be relaxed in the sense that we require only a given fraction of vertices to have the prescribed degree.
A graph $G$ is $k$-path-coverable if its vertex set $V(G)$ can be covered by $k$ or fewer vertex disjoint paths. In this paper, using the $Q$-index of a connected graph $G$, we present a tight sufficient condition for $G$ with fixed minimum degree and large order to be $k$-path-coverable.
This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy conjectur
e of Propp that for the action of a Coxeter element of vertex toggles, the difference of indicator functions of symmetrically-located vertices is 0-mesic. Then we use our analysis to show facts about orbit sizes that are easy to conjecture but nontrivial to prove. Besides its intrinsic interest, this particular combinatorial dynamical system is valuable in providing an interesting example of (a) homomesy in a context where large orbit sizes make a cyclic sieving phenomenon unlikely to exist, (b) the use of Coxeter theory to greatly generalize the set of actions for which results hold, and (c) the usefulness of Strikers notion of generalized toggle groups.
Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $nge2$. In this paper, we study t
he existence of a hamiltonian path in $L^n(G)$, and give a characterization of $G$ for which $L^n(G)$ has a hamiltonian path. As applications, we use this characterization to give several upper bounds on the hamiltonian path index of a graph.
Let $S_k(n)$ be the maximum number of orientations of an $n$-vertex graph $G$ in which no copy of $K_k$ is strongly connected. For all integers $n$, $kgeq 4$ where $ngeq 5$ or $kgeq 5$, we prove that $S_k(n) = 2^{t_{k-1}(n)}$, where $t_{k-1}(n)$ is t
he number of edges of the $n$-vertex $(k-1)$-partite Turan graph $T_{k-1}(n)$, and that $T_{k-1}(n)$ is the only $n$-vertex graph with this number of orientations. Furthermore, $S_4(4) = 40$ and this maximality is achieved only by $K_4$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
