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

Paper

Advanced lithography kits: Serifs and hammerhead

Hang-Yip Liu, Steffen Schulze, et al.

Proceedings of SPIE - The International Society for Optical Engineering

Conference paper

Optimization of real phase-mask performance

F.M. Schellenberg, M. Levenson, et al.

BACUS Symposium on Photomask Technology and Management 1991

Paper

A globally convergent lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

A.R. Conn, Nick Gould, et al.

Mathematics of Computation

Paper

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Charles A Micchelli

Journal of Approximation Theory

View all publications