Combinatorial Theorems on Classifications of Subsets of a Given Set
From MaRDI portal
Publication:5814905
DOI10.1112/plms/s3-2.1.417zbMath0048.28203WikidataQ105914105 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
Partition relations for cardinal numbers, A two-coloring of Cartesian products, Ramsey numbers of sparse hypergraphs, Happy families and completely Ramsey sets, Some new van der Waerden numbers, Edge-colored complete graphs with precisely colored subgraphs, Modular arithmetic of iterated powers, On Ramsey families of sets, Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers, Bounds on some van der Waerden numbers, Phase transitions for Gödel incompleteness, Van der Waerden and Ramsey type games, Partition relations for partially ordered sets, Values and bounds for Ramsey numbers associated with polynomial iteration, A lower estimate for the achromatic number of irreducible graphs, Analyzing Nash-Williams' partition theorem by means of ordinal types, Partition theorems for factorizations of ascending parameter words, Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\), Variations on a game, On Erdős-Rado numbers, On partitioning integers into progression free sets, A partition problem on colored sets, Lower bounds for hypergraph Ramsey numbers, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, Ordinary partition relations for ordinal numbers, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results, A partition calculus in set theory, On the structure of set-mappings, Ramsey Games, Primitive Recursive Bounds for Van Der Waerden Numbers, A Partition Theorem for the Infinite Subtrees of a Tree
