On the independence number of random graphs (Q923109): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q57401600, #quickstatements; #temporary_batch_1711055989931 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401600 / rank | |||
Normal rank | |||
Revision as of 23:03, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the independence number of random graphs |
scientific article |
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
