The Independence Number of Dense Graphs with Large Odd Girth
نویسندگان
چکیده
منابع مشابه
The Independence Number of Dense Graphs with Large Odd Girth
Let G be a graph with n vertices and odd girth 2k+3. Let the degree of a vertex v of G be d1(v). Let (G) be the independence number of G. Then we show (G) 2 ( k 1 k ) "X v2G d1(v) 1 k 1 #(k 1)=k . This improves and simpli es results proven by Denley [1]. AMS Subject Classi cation. 05C35 Let G be a graph with n vertices and odd girth 2k + 3. Let di(v) be the number of points of degree i from a v...
متن کاملThe Independence Number of Graphs with Large Odd Girth
Let G be an r-regular graph of order n and independence number α(G). We show that if G has odd girth 2k + 3 then α(G) ≥ n1−1/kr1/k . We also prove similar results for graphs which are not regular. Using these results we improve on the lower bound of Monien and Speckenmeyer, for the independence number of a graph of order n and odd girth 2k + 3. AMS Subject Classification. 05C15 §
متن کاملCircular Chromatic Number of Planar Graphs of Large Odd Girth
It was conjectured by Jaeger that 4k-edge connected graphs admit a (2k + 1, k)-flow. The restriction of this conjecture to planar graphs is equivalent to the statement that planar graphs of girth at least 4k have circular chromatic number at most 2 + 1 k . Even this restricted version of Jaeger’s conjecture is largely open. The k = 1 case is the well-known Grötzsch 3-colour theorem. This paper ...
متن کاملDense Minors In Graphs Of Large Girth
We show that a graph of girth greater than 6 log k + 3 and minimum degree at least 3 has a minor of minimum degree greater than k. This is best possible up to a factor of at most 9/4. As a corollary, every graph of girth at least 6 log r + 3 log log r + c and minimum degree at least 3 has a Kr minor.
متن کاملn-Tuple Coloring of Planar Graphs with Large Odd Girth
The main result of the papzer is that any planar graph with odd girth at least 10k À 7 has a homomorphism to the Kneser graph G 2k1 k , i.e. each vertex can be colored with k colors from the set f1; 2;. .. ; 2k 1g so that adjacent vertices have no colors in common. Thus, for example, if the odd girth of a planar graph is at least 13, then the graph has a homomorphism to G 5 2 , also known as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1995
ISSN: 1077-8926
DOI: 10.37236/1221