The complexity of proving that a graph is Ramsey (Q1705815): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q61732573, #quickstatements; #temporary_batch_1711055989931 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q61732573 / rank | |||
Normal rank | |||
Revision as of 00:37, 22 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of proving that a graph is Ramsey |
scientific article |
Statements
The complexity of proving that a graph is Ramsey (English)
0 references
16 March 2018
0 references
Ramsey graphs
0 references
