Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
A. Skumanich
SPIE OE/LASE 1992
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Heng Cao, Haifeng Xi, et al.
WSC 2003