A Combinatorial Theorem
From MaRDI portal
Publication:5797044
DOI10.1112/jlms/s1-25.4.249zbMath0038.15301OpenAlexW2066486518MaRDI QIDQ5797044
Publication date: 1950
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-25.4.249
Related Items
A partition problem on colored sets, Infinite stable graphs with large chromatic number, Hereditary attributes of surjections and parameter sets, Transforming comparison model lower bounds to the parallel-random-access-machine, Properly coloured copies and rainbow copies of large graphs with small maximum degree, Regressive Partition Relations for Infinite Cardinals, Canonical partition relations for \((m,p,c)\)-systems, Canonical forms of Borel-measurable mappings \(\Delta: [\omega^{\omega}\to {\mathbb{R}}\)], Ordered and canonical Ramsey numbers of stars, Canonical forms of Borel functions on the Milliken space, Turán problems and shadows. II: Trees, Automorphisms of models of arithmetic: a unified view, Bounded colorings of multipartite graphs and hypergraphs, Separating families and order dimension of Turing degrees, Rainbow generalizations of Ramsey theory: A survey, A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies, Topological Ramsey spaces from Fraïssé classes, Ramsey-classification theorems, and initial structures in the Tukey types of \(p\)-points, On elementary equivalence and isomorphism of clone segments, A canonical partition theorem for uniform families of finite strong subtrees, Canonical Borel equivalence relations on \(\mathbb R^n\), On an anti-Ramsey threshold for random graphs, Exactly \(m\)-coloured complete infinite subgraphs, Some variations on the splitting number, Long directed rainbow cycles and rainbow spanning trees, How many colors guarantee a rainbow matching?, A partition calculus in set theory, Higher-dimensional delta-systems, A Rainbow Erdös--Rothschild Problem, On the canonical Ramsey theorem of Erdős and Rado and Ramsey ultrafilters, On quantitative aspects of a canonisation theorem for edge‐orderings, The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes, Canonical Theorems for Colored Integers with Respect to Some Linear Combinations, The structure of large intersecting families, On Neighbourly Triangulations, Canonizing structural Ramsey theorems, On Ramsey families of sets, Partition theorems for systems of finite subsets of integers, Rainbow structures in locally bounded colorings of graphs, A short proof of the canonical polynomial van der Waerden theorem, Properly colored and rainbow copies of graphs with few cherries, Embedding rainbow trees with applications to graph labelling and decomposition, Splitting squares, Rainbow Hamiltonian cycles in strongly edge-colored graphs, Combinatorial unprovability proofs and their model-theoretic counterparts, Properly edge-coloured subgraphs in colourings of bounded degree, Regressive partition relations, \(n\)-subtle cardinals, and Borel diagonalization, A dual form of Erdős-Rado's canonization theorem, Monochromatic sumset without large cardinals, Distinct volume subsets via indiscernibles, Boolean algebras and Lubell functions, A Ramseyan theorem and an infinite game, Edge-colorings avoiding rainbow and monochromatic subgraphs, Constrained Ramsey numbers for rainbow matching, A new class of Ramsey-classification theorems and their application in the Tukey theory of ultrafilters, Part 1, A large number of \(m\)-coloured complete infinite subgraphs, Fast growing functions based on Ramsey theorems, ACCEPTABLE COLORINGS OF INDEXED HYPERSPACES, Largest initial segments pointwise fixed by automorphisms of models of set theory, Orientable edge colorings of graphs, Monochromatic vs multicolored paths, The canonical Ramsey theorem and computability theory, Rainbow decompositions, A canonical partition relation for finite subsets of \(\omega\), Canonical forms of shift-invariant maps on \([\mathbb N^{\infty}\)], Counting canonical partitions in the random graph, On Gödel incompleteness and finite combinatorics, Linearly many rainbow trees in properly edge-coloured complete graphs, Canonization theorems for finite affine and linear spaces, Constrained Ramsey Numbers, Constrained Ramsey Numbers, Canonical Ramsey numbers and properly colored cycles, The Erdős-Ko-Rado properties of set systems defined by double partitions, A new class of Ramsey-classification theorems and their applications in the Tukey theory of ultrafilters, Part 2, On Erdős-Rado numbers, A canonical partition theorem for equivalence relations on \(Z^ n\)., Unordered canonical Ramsey numbers, Canonical partition theorems for parameter sets, Canonizing Ramsey theorems for finite graphs and hypergraphs, Hereditary classes of graphs: a parametric approach, Canonizing partition theorems: Diversification, products, and iterated versions, The diversity of minimal cofinal extensions, Ramsey theory for countable binary homogeneous structures, Mono-multi bipartite Ramsey numbers, designs, and matrices
