On the independence number of random graphs (Q923109): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dm/Frieze90, #quickstatements; #temporary_batch_1731505720702 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90149-c / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079330337 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dm/Frieze90 / rank | |||
Normal rank | |||
Latest revision as of 14:59, 13 November 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
