Two proofs of the Ramsey property of the class of finite hypergraphs (Q1835932): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Models Without Indiscernibles
@@ Property / cites work: Models Without Indiscernibles / rank @@
+Normal rank
@@ Property / cites work @@
+Q4056030
@@ Property / cites work: Q4056030 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
+Normal rank
@@ Property / cites work @@
+Q3903002
@@ Property / cites work: Q3903002 / rank @@
+Normal rank
@@ Property / cites work @@
+Regularity and Positional Games
@@ Property / cites work: Regularity and Positional Games / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions of finite relational and set systems
@@ Property / cites work: Partitions of finite relational and set systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4111618
@@ Property / cites work: Q4111618 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3872505
@@ Property / cites work: Q3872505 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3869384
@@ Property / cites work: Q3869384 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
+Normal rank