Random Structures & Algorithms

Paper

01 Jan 1995

On the independence number of sparse graphs

View publication

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

Conference paper

Single and dual wavelength exposure of photoresist

J. LaRue, C. Ting

Proceedings of SPIE 1989

Paper

Soft decoding of several classes of array codes

Mario Blaum, John L. Fan, et al.

IEEE International Symposium on Information Theory - Proceedings

Conference paper

Characterization of photoresist spatial resolution by interferometric lithography

John A. Hoffnagle, William D. Hinsberg, et al.

Microlithography 2003

Paper

The multiplicative complexity of the Discrete Fourier Transform

L Auslander, E Feig, et al.

Advances in Applied Mathematics

View all publications