2015•Discrete Applied MathematicsOpen access

A lower bound on the independence number of a graph in terms of degrees and local clique sizes

Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer

Open full text 4 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Independence number, Combinatorics, Mathematics, Conjecture, Clique number, Vertex (graph theory), Perfect graph, Upper and lower bounds

Back to paper search Browse research topics Original source

A lower bound on the independence number of a graph in terms of degrees and local clique sizes — Research Paper | ScholarLens