Indexed metadata

The independence number of graphs with large odd girth

Tristan Denley

Source record

Source: Crossref

Published: Sep 17, 1994

DOI: 10.37236/1189

Open original source ↗

Source abstract

Let GG be an rr-regular graph of order nn and independence number α(G)\alpha(G). We show that if GG has odd girth 2k+32k+3 then α(G)≥n1−1/kr1/k\alpha(G)\geq n^{1-1/k}r^{1/k}. We also prove similar results for graphs which are not regular. Using these results we improve on the lower bound of Monien and Speckenmeyer, for the independence number of a graph of order nn and odd girth 2k+32k+3.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

The independence number of graphs with large odd girth — Mathematical Frontier Network