Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size (Q6084357)
From MaRDI portal
scientific article; zbMATH DE number 7758316
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size |
scientific article; zbMATH DE number 7758316 |
Statements
31 October 2023
0 references
random graphs
0 references
preferential attachment
0 references
sparsity
0 references
somewhere dense
0 references
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size (English)
0 references
0 references
