Sparse partition universal graphs for graphs of bounded degree (Q633606): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q101500317, #quickstatements; #temporary_batch_1710862453543 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.aim.2011.01.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078983092 / rank | |||
Normal rank | |||
Revision as of 18:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparse partition universal graphs for graphs of bounded degree |
scientific article |
Statements
Sparse partition universal graphs for graphs of bounded degree (English)
0 references
29 March 2011
0 references
size-Ramsey numbers
0 references
universal graphs
0 references
regularity Lemma
0 references
random graphs
0 references
inheritance of regularity
0 references
