Combinatorial Theorems on Classifications of Subsets of a Given Set
From MaRDI portal
Publication:5814905
DOI10.1112/plms/s3-2.1.417zbMath0048.28203OpenAlexW1996516812WikidataQ105914105 ScholiaQ105914105MaRDI QIDQ5814905
Publication date: 1952
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-2.1.417
Related Items
A partition problem on colored sets, Partition relations for partially ordered sets, Phase transition results for three Ramsey-like theorems, Transforming comparison model lower bounds to the parallel-random-access-machine, Ramsey properties of algebraic graphs and hypergraphs, Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\), STRUCTURAL CONSIDERATIONS OF RAMSEY ALGEBRAS, Values and bounds for Ramsey numbers associated with polynomial iteration, Ramsey Games, Lower bounds for hypergraph Ramsey numbers, Unnamed Item, Ramsey-type results for semi-algebraic relations, A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS, PRIMITIVE RECURSIVE BOUNDS FOR THE FINITE VERSION OF GOWERS’ THEOREM, Off-diagonal hypergraph Ramsey numbers, On the lower bound for the van der Waerden function, A note on the Erdős-Hajnal hypergraph Ramsey problem, On colorings of variable words, The dynamic descriptive complexity of \(k\)-clique, Rainbow generalizations of Ramsey theory: A survey, The Erdős-Hajnal hypergraph Ramsey problem, Van der Waerden function and colorings of hypergraphs with large girth, On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, Two extensions of Ramsey's theorem, A new lower bound for van der Waerden numbers, Tower Gaps in Multicolour Ramsey Numbers, Sharp thresholds for hypergraph regressive Ramsey numbers, Ramsey numbers of semi-algebraic and semi-linear hypergraphs, On 3‐graphs with no four vertices spanning exactly two edges, Concentration estimates for functions of finite high‐dimensional random arrays, A Partition Theorem for the Infinite Subtrees of a Tree, Hypergraph Ramsey numbers of cliques versus stars, A partition calculus in set theory, Semi-algebraic Ramsey numbers, On the canonical Ramsey theorem of Erdős and Rado and Ramsey ultrafilters, On quantitative aspects of a canonisation theorem for edge‐orderings, Erdős-Szekeres theorem for multidimensional arrays, A lower estimate for the achromatic number of irreducible graphs, Ramsey numbers of cliques versus monotone paths, A Note on Induced Ramsey Numbers, Multicolor Ramsey numbers for triple systems, Higher-order Erdős-Szekeres theorems, On Ramsey families of sets, On construction of equitable social welfare orders on infinite utility streams, On the structure of set-mappings, Two Erdős-Hajnal-type theorems in hypergraphs, A two-coloring of Cartesian products, RAMSEY GROWTH IN SOME NIP STRUCTURES, A REFINEMENT OF THE RAMSEY HIERARCHY VIA INDESCRIBABILITY, Proof of a conjecture of Galvin, Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers, Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs, On construction of social welfare orders satisfying Hammond equity and weak Pareto axioms, Colourings of Uniform Hypergraphs with Large Girth and Applications, Analyzing Nash-Williams' partition theorem by means of ordinal types, Heterogeneous Ramsey algebras and classification of Ramsey vector spaces, Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems, Bounds on some van der Waerden numbers, Happy families and completely Ramsey sets, Relationship between Kanamori-McAloon Principle and Paris-Harrington Theorem, Large almost monochromatic subsets in hypergraphs, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, Hypergraph Ramsey numbers, Erdős-Hajnal-type theorems in hypergraphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Set mappings on 4-tuples, Combining monotonicity and strong equity: construction and representation of orders on infinite utility streams, Local approximation of the maximum cut in regular graphs, Phase transitions for Gödel incompleteness, Lower bounds on the clique-chromatic numbers of some distance graphs, A Ramsey-type result for geometric \(\ell\)-hypergraphs, Ramsey numbers of sparse hypergraphs, On edge‐ordered Ramsey numbers, Ramsey numbers of sparse hypergraphs, On Ramsey numbers of hedgehogs, Some new van der Waerden numbers, Primitive Recursive Bounds for Van Der Waerden Numbers, Ordinary partition relations for ordinal numbers, On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs, Variations on a game, Partition theorems for factorizations of ascending parameter words, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results, Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces, Edge-colored complete graphs with precisely colored subgraphs, On Erdős-Rado numbers, On partitioning integers into progression free sets, Modular arithmetic of iterated powers, Van der Waerden and Ramsey type games, Partition relations for cardinal numbers
