Heng Cao, Haifeng Xi, et al.
WSC 2003
Paper
On the independence number of sparse graphs
Abstract
Let G be a regular graph of degree d on n points which contains no Kr (r ≥ 4). Let α be the independence number of G. Then we show for large d that α ≥ c(r)n . © 1995 John Wiley & Sons, Inc. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company
Related
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics