Counting connected graphs and hypergraphs via the probabilistic method (Q5433264): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/rsa.20160 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.20160 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1499020887 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/RSA.20160 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:59, 30 December 2024
scientific article; zbMATH DE number 5224126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting connected graphs and hypergraphs via the probabilistic method |
scientific article; zbMATH DE number 5224126 |
Statements
Counting connected graphs and hypergraphs via the probabilistic method (English)
0 references
8 January 2008
0 references
random graphs
0 references
random hypergraphs
0 references
giant component
0 references
connectivity
0 references
probabilistic method
0 references
