Minimum independent generalized t-degree and independence number in K1, r+1-free graphs
نویسندگان
چکیده
The minimum independent generalized t-degree of a graph G = (V,E) is ut = min{ IN(H H is an independent set of t vertices of G}, with N(H) = UxtH N(x). In a KI,~+I -free graph, we give an upper bound on u! in terms of r and the independence number CI of G. This generalizes already known results on u2 in KI,,+I-free graphs and on U, in KI,x-free graphs.
منابع مشابه
On the independence number in K1, r+1-free graphs
In this paper we use the degree sequence, order, size and vertex connectivity of a K 1,,+ 1 -free graph or of an almost claw-free graph to obtain several upper bounds on its independence number. We also discuss the sharpness of these results.
متن کاملDegree sequence index strategy
We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence. As an illustration of the DSI strategy, we show how it can be used to give new upper and lower bounds on the k-independence and the k-domination numbers. These include, among other things, a double generalization of the annihilation num...
متن کاملMinimum degree and disjoint cycles in generalized claw-free graphs
For s ≥ 3 a graph is K1,s-free if it does not contain an induced subgraph isomorphic to K1,s. Cycles in K1,3-free graphs, called clawfree graphs, have beenwell studied. In this paper we extend results on disjoint cycles in claw-free graphs satisfying certain minimum degree conditions to K1,s-free graphs, normally called generalized claw-free graphs. In particular, we prove that if G is K1,s-fre...
متن کامل2-Factors in r-Connected {K1,k, P4}-Free Graphs
In [3], Faudree et.al. considered the proposition “Every {X, Y }-free graph of sufficiently large order has a 2-factor,” and they determined those pairs {X, Y } which make this proposition true. Their result says that one of them is {X, Y } = {K1,4, P4}. In this paper, we investigate the existence of 2-factors in r-connected {K1,k, P4}-free graphs. We prove that if r ≥ 1 and k ≥ 2, and if G is ...
متن کاملPacking nearly optimal Ramsey R(3, t) graphs
In 1995 Kim famously proved the Ramsey bound R(3, t) ≥ ct/ log t by constructing an n-vertex graph that is triangle-free and has independence number at most C √ n log n. We extend this celebrated result, which is best possible up to the value of the constants, by approximately decomposing the complete graph Kn into a packing of such nearly optimal Ramsey R(3, t) graphs. More precisely, for any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 165-166 شماره
صفحات -
تاریخ انتشار 1997