Randomly finding independent sets in locally sparse graphs (Q2099383)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Randomly finding independent sets in locally sparse graphs |
scientific article; zbMATH DE number 7622513
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomly finding independent sets in locally sparse graphs |
scientific article; zbMATH DE number 7622513 |
Statements
Randomly finding independent sets in locally sparse graphs (English)
0 references
23 November 2022
0 references
The independence number is one of the pertinent parameters of a graph and finding the same for a general graph is a very hard problem. Some random algorithms for finding the same are available in the literature. The authors of this paper obtain a lower bound for the independence number using the independent ratio. The proof of their main result is divided into different lemmas for better comprehensibility.
0 references
independence number
0 references
\((k, m)\)-colorable
0 references
local sparseness
0 references
