IBM - Personal communication

This web page contains the abstract of my paper:

"The Independence Number of Dense Graphs with Large Odd Girth", The Electronic Journal of Combinatorics, 2(1995), #N2.

Abstract: Let G be a graph with n vertices and odd girth 2*k+3. Let the degree of a vertex v of G be d1(v). Let a(G) be the independence number of G. Then we show a(g) >= [2**(-(k-1)/k)]*[Sum over v contained in G of {d1(v)**(1/(k-1))}]**((k-1)/k). This improves and simplifies results proven by Denly [1].

[ IBM Research home page | James B. Shearer's home page | Up ]
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]