The complexity of proving that a graph is Ramsey (Q1705815)
From MaRDI portal
(Redirected from Item:Q5326602)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1705815 |
scientific article; zbMATH DE number 6195466
- The Complexity of Proving That a Graph Is Ramsey
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of proving that a graph is Ramsey |
scientific article; zbMATH DE number 6195466 |
|
Statements
The complexity of proving that a graph is Ramsey (English)
0 references
The Complexity of Proving That a Graph Is Ramsey (English)
0 references
16 March 2018
0 references
6 August 2013
0 references
Ramsey graphs
0 references
0.9967625737190248
0 references
0.8189012408256531
0 references
0.8076186776161194
0 references
0.7775378823280334
0 references