M. Tismenetsky
International Journal of Computer Mathematics
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
M. Tismenetsky
International Journal of Computer Mathematics
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics