Finding Folkman Numbers via MAX CUT Problem (Q3503536): Difference between revisions

@@ Property / cites work @@
+Q4382659
@@ Property / cites work: Q4382659 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4116466
@@ Property / cites work: Q4116466 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
+Normal rank
@@ Property / cites work @@
+Large triangle-free subgraphs in graphs without \(K_ 4\)
+Normal rank
@@ Property / cites work @@
+On Sets of Acquaintances and Strangers at any Party
+Normal rank
@@ Property / cites work @@
+On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
+Normal rank
@@ Property / cites work @@
+On a bound of Graham and Spencer for a graph-colouring constant
+Normal rank
@@ Property / cites work @@
+Explicit Construction of Small Folkman Graphs
@@ Property / cites work: Explicit Construction of Small Folkman Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Ramsey property for graphs with forbidden complete subgraphs
+Normal rank
@@ Property / cites work @@
+Computation of the Folkman numberFe(3, 3; 5)
@@ Property / cites work: Computation of the Folkman numberFe(3, 3; 5) / rank @@
+Normal rank
@@ Property / cites work @@
+Three hundred million points suffice
@@ Property / cites work: Three hundred million points suffice / rank @@
+Normal rank