Embedding graphs with bounded degree in sparse pseudorandom graphs (Q1885587): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q105583410, #quickstatements; #temporary_batch_1710970253704 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q105583410 / rank | |||
Normal rank | |||
Revision as of 22:42, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding graphs with bounded degree in sparse pseudorandom graphs |
scientific article |
Statements
Embedding graphs with bounded degree in sparse pseudorandom graphs (English)
0 references
11 November 2004
0 references
A quasi-random graph sequence \(G(n)\) is defined consisting of sparse graphs of increasing order \(n\). Conditions are given to find in \(G(n)\) the asymptotic number of labeled copies of a fixed triangle-free graph \(H\).
0 references
quasi-random graph
0 references
triangle-free graph
0 references
graph embedding
0 references
