Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
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
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Amotz Bar-Noy, Sudipto Guha, et al.
ACM Transactions on Algorithms
Conference paper
On the order of transmissions in multiaccess channels
Ilan Kessler, Moshe Sidi
ISIT 1991