Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 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
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003