Lior Horesh, Vasileios Kalantzis, et al.
HPEC 2025
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
T.A. Brunner, V. Menon, et al.
SPIE Advanced Lithography 2014
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences