Divide and conquer martingales and the number of triangles in a random graph (Q4459588): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (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.1002/rsa.10113 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128405006 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper tails for subgraph counts in random graphs / rank | |||
Normal rank | |||
Latest revision as of 15:27, 6 June 2024
scientific article; zbMATH DE number 2062667
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide and conquer martingales and the number of triangles in a random graph |
scientific article; zbMATH DE number 2062667 |
Statements
Divide and conquer martingales and the number of triangles in a random graph (English)
0 references
29 March 2004
0 references
