On the size of a random maximal graph (Q4697820): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: Q189726 / rank | |||
| Property / author | |||
| Property / author: Paul Erdős / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q106175748 / rank | |||
Normal 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.3240060217 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134771417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random Graph Processes with Degree Restrictions / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:12, 23 May 2024
scientific article; zbMATH DE number 749560
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the size of a random maximal graph |
scientific article; zbMATH DE number 749560 |
Statements
On the size of a random maximal graph (English)
0 references
28 May 1995
0 references
Ramsey number \(R(3,k)\)
0 references
random graph
0 references
triangle avoidance process
0 references
