论文信息 - A note on the independence number of triangle-free graphs, II

A note on the independence number of triangle-free graphs, II

Let G be a triangle-free graph on n points with degree sequence d1, …, dn. Let α be the independence number of G. Let f(0) = 1, f(d) = [1 + (d2 − d) f(d − 1)](d2 + 1)d ≥ 1. We prove α ≥ Σi = 1n f(di). We also show slightly stronger results as the girth of G tends to ∞.

James B. Shearer

[1] János Komlós,et al. On Turán’s theorem for sparse graphs , 1981, Comb..

[2] W. Staton. Some Ramsey-type numbers and the independence ratio , 1979 .

[3] János Komlós,et al. A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.

[4] Béla Bollobás,et al. The independence ratio of regular graphs , 1981 .

[5] Jerrold R. Griggs. An Upper Bound on the Ramsey Numbers R(3, k) , 1983, J. Comb. Theory, Ser. A.

[6] Alexandr V. Kostochka,et al. On an upper bound of a graph's chromatic number, depending on the graph's degree and density , 1977, J. Comb. Theory B.

[7] Jerrold R. Griggs. Lower bounds on the independence number in terms of the degrees , 1983, J. Comb. Theory, Ser. B.

[8] János Komlós,et al. A Dense Infinite Sidon Sequence , 1981, Eur. J. Comb..

[9] G. Hopkins,et al. Girth and Independence Ratio , 1982, Canadian Mathematical Bulletin.

[10] Paul A. Catlin. A bound on the chromatic number of a graph , 1978, Discret. Math..

[11] James B. Shearer,et al. A note on the independence number of triangle-free graphs , 1983, Discret. Math..

[12] János Komlós,et al. Extremal Uncrowded Hypergraphs , 1982, J. Comb. Theory, Ser. A.