On the independence number of random graphs (Q923109): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57401600, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3682518 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cliques in random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On colouring random graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5610923 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expose-and-merge exploration and the chromatic number of a random graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Results on the Complete and Almost Sure Convergence of Linear Combinations of Independent Random Variables and Martingale Differences / rank | |||
Normal rank | |||
Revision as of 11:02, 21 June 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
