The complexity of proving that a graph is Ramsey (Q1705815): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+The Complexity of Proving That a Graph Is Ramsey
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6195466
@@ Property / title @@
+The Complexity of Proving That a Graph Is Ramsey (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.03066
@@ Property / zbMATH Open document ID: 1336.03066 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-39206-1_58
@@ Property / DOI: 10.1007/978-3-642-39206-1_58 / rank @@
+Normal rank
@@ Property / published in @@
+Automata, Languages, and Programming
@@ Property / published in: Automata, Languages, and Programming / rank @@
+Normal rank
@@ Property / publication date @@
+August 2013Timestamp +2013-08-06T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2013-08-06T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 6 August 2013 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6195466
@@ Property / zbMATH DE Number: 6195466 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2158868891
@@ Property / OpenAlex ID: W2158868891 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q61732584
@@ Property / Wikidata QID: Q61732584 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
-Publication:1705815
+Publication:5326602