On the independence number of random graphs (Q923109)
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: On the independence number of random graphs |
scientific article; zbMATH DE number 4170957
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the independence number of random graphs |
scientific article; zbMATH DE number 4170957 |
Statements
On the independence number of random graphs (English)
0 references
1990
0 references
The independence number (the largest number of vertices not joined by any edges) is considered for a Bernoulli graph of order n with edge probability \(p=0(1)\). A result concerning convergence in probability is proved by using a martingale inequality.
0 references
random graphs
0 references
independence number
0 references
Bernoulli graph
0 references
convergence in probability
0 references
martingale
0 references
