An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths (Q5364242): Difference between revisions

@@ Property / Wikidata QID @@
+Q105585042
@@ Property / Wikidata QID: Q105585042 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1663
@@ Property / arXiv ID: 1405.1663 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit construction of linear sized tolerant networks
+Normal rank
@@ Property / cites work @@
+On size Ramsey number of paths, trees, and circuits. I
+Normal rank
@@ Property / cites work @@
+Q3972752
@@ Property / cites work: Q3972752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3728934
@@ Property / cites work: Q3728934 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinatorial problems which I would most like to see solved
+Normal rank
@@ Property / cites work @@
+The size Ramsey number
@@ Property / cites work: The size Ramsey number / rank @@
+Normal rank
@@ Property / cites work @@
+Q5548200
@@ Property / cites work: Q5548200 / rank @@
+Normal rank
@@ Property / cites work @@
+Path Ramsey Number for Random Graphs
@@ Property / cites work: Path Ramsey Number for Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning edge-coloured complete graphs into monochromatic cycles and paths
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5364242