On a Problem of Formal Logic

1930/01/01 by F. P. Ramsey, Frank Plumpton Ramsey · 1,931 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Topology and Set Theory #Arithmetic #Citation #Computability, Logic, AI Algorithms #Computer science #Information retrieval #Library science #Mathematical economics #Mathematics

paper · doi:10.1112/plms/s2-30.1.264

published in Proceedings of the London Mathematical Society s2-30(1), 264-286 (Wiley)

openalex publication_date 1930/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/14

Cited by

• Is Randomness Necessary for Adaptive Data Analysis?
• Solutions to Two Problems of Sárközy and Sós on Additive Representation Functions
• On the Erdős-Rogers function
• Parameterized Complexity of Efficient Sortation
• Iterated Ramsey bounds for the Hales-Jewett numbers
• Off-diagonal Ramsey numbers
• An exponential improvement for Ramsey lower bounds
• Turán number of bipartite graphs with no K_t,t
• Multicoloured Ramsey numbers of the path of length four
• A Ramsey theorem for pairs in trees
• Ramsey numbers of sparse hypergraphs
• Spreading Models in Banach Space Theory
• Chains conditions in algebraic lattices
• On the Dual Ramsey Property for Finite Distributive Lattices
• Triangular Ramsey Numbers
• On minimal prime graphs and posets
• Combinatorial theorems relative to a random set
• Canonical equivalence relations on nets of PS_c0
• A Ramsey-Classification Theorem and its Application in the Tukey Theory of Ultrafilters
• Reach together: How populations win repeated games
• On the minimum degree of minimal Ramsey graphs for multiple colours
• Level Two of the Quantifier Alternation Hierarchy over Infinite Words
• A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs
• Gaussian random graphs and Ramsey numbers
• The d-chromatic Ramsey number for stars
• A note on the maximum ratio between chromatic number and clique number
• Ramsey numbers for partially-ordered sets
• Boolean lattices: Ramsey properties and embeddings
• Weakly-unambiguous Parikh automata and their link to holonomic series
• Online Ramsey turnaround numbers
• Unavoidable patterns and plane paths in dense topological graphs
• Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties
• Bounded treewidth, multiple context-free grammars, and downward closures
• On edge-ordered Ramsey numbers
• Off-Diagonal Continuous Rado Numbers x₁ + x₂ + … + x_k = x₀
• Acyclic dichromatic number of oriented graphs
• Asymmetric Ramsey numbers of trees
• Solutions to conjectures on the (k,ℓ)-rainbow index of complete graphs
• Universal sequences of lines in \mathbb R^d
• Awesome graph parameters
• Graphs with asymmetric Ramsey properties
• Fixed-parameter tractability and hardness for Steiner rooted and locally connected orientations
• On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic
• Local algorithms in (weakly) coloured graphs
• On the denseness of distal points
• Graph structure via local occupancy
• An Optimal Bound for Ramsey Goodness of Cycles
• Fundamental Limits of Exact Support Recovery in High Dimensions
• A transference principle for Ramsey numbers of bounded degree graphs
• On Erdős-Ko-Rado for random hypergraphs II
• On the balanceability of some graph classes
• On the structure of the spreading models of a Banach space
• On the Ramsey Numbers for Bipartite Multigraphs
• A conjecture of Erdős on graph Ramsey numbers
• Subsets of Products of Finite Sets of Positive Upper Density
• On generalized Ramsey numbers for 3-uniform hypergraphs
• Improving R(3,k) in just two bites
• Polynomial bounds for pathwidth
• Constrained Ramsey numbers for rainbow P₅
• (Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence
• Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
• Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
• Nonpositive Eigenvalues of the Adjacency Matrix and Lower Bounds for Laplacian Eigenvalues
• New Upper Bound for the Edge Folkman Number Fe(3,5;13)
• Ramsey numbers of long even cycles versus books
• Ramsey sequences with bounded clique size
• List coloring ordered graphs with forbidden induced subgraphs
• Closure Properties for Private Classification and Online Prediction
• Bounding the Eviction Number of a Graph in Terms of its Independence Number
• Categorical Constructions and the Ramsey Property
• On the integrability of strongly regular graphs
• The Story of Sunflowers
• Tree-independence number VI. Thetas and pyramids
• New Helly-type results for discrete boxes: Quantitative colorful and (p,q)-variants
• Strong Ramsey Games: Drawing on an infinite board
• Multicolor Erdős--Rogers Functions
• On Erdös--Szekeres problem and related problems
• The pigenhole principle and multicolor Ramsey numbers
• Ramsey, for Auld Lang Syne
• Combinatorial theorems in sparse random sets
• Random-projector quantum diagnostics of Ramsey numbers and a prime-factor heuristic for R(5,5)=45
• Uniform Turán density beyond 3-graphs
• Computer-assisted graph theory: a survey
• On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness
• Ramsey dichotomies with ordinal index
• A note on monotonicity of mixed Ramsey numbers
• Turán theorems for unavoidable patterns
• Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution
• A Statement in Combinatorics that is Independent of ZFC (an exposition)
• Control Closure Certificates
• Obstructions for three-coloring and list three-coloring H-free graphs
• A Simple Regularization of Hypergraphs
• Monochromatic factorisations of words and periodicity
• Large book--cycle Ramsey numbers
• Fractional chromatic number, maximum degree and girth
• On three-color Ramsey number of paths
• On growth rates of permutations, set partitions, ordered graphs and other objects
• Discrepancy and large dense monochromatic subsets
• A new class of Ramsey-classification theorems and their applications in the Tukey theory of ultrafilters
• Unsolved Problems in Visibility Graphs of Points, Segments and Polygons
• Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees
• Proving programs terminate using well orderings, Ramsey Theory, and Matrices
• Erdős-Rado Classes
• A characterization of Fibonacci numbers
• Countable sets versus sets that are countable in Reverse Mathematics
• Monotone paths in random hypergraphs
• Asymptotically optimal Ramsey goodness of sparse graphs versus odd cycles and paths
• Oblivious Online Contention Resolution Schemes
• Excluding an induced wheel minor in graphs without large induced stars
• A c_0-saturated Banach space with no long unconditional basic sequences
• Elementary Techniques for Erdos-Ko-Rado-like Theorems
• Ramsey Property and Block Oscillation Stability on Normalized Sequences in Banach Spaces
• Explicit geometric construction of Ramsey graphs
• Infinite Ramsey-minimal graphs for star forests
• Languages of Dot-depth One over Infinite Words
• The quantum Ramsey numbers QR(2,k)
• Finite order spreading models
• Size-Ramsey numbers of tight paths
• Tight paths in fully directed hypergraphs
• Sums and products in sets of positive density
• Making Logic a First-Class Citizen in Generative ML for Networking
• Edge-colouring and orientations: applications to degree- and χ-boundedness
• Bounds on some edge Folkman numbers
• Edge Clique Partition and Cover Beyond Independence
• The Profile of relations
• Hypergraph Ramsey numbers
• Properly coloured copies and rainbow copies of large graphs with small maximum degree
• A proof for a conjecture of Gyarfas, Lehel, Sarkozy and Schelp on Berge-cycles
• Complexity of Token Swapping and Its Variants
• Saturation numbers for Ramsey-minimal graphs
• Schreier Sets in Ramsey Theory
• Local Approximability of Minimum Dominating Set on Planar Graphs
• Ordered Ramsey numbers
• Induced subgraphs and tree decompositions XIX. Thetas and forests
• Questions and answers -- a category arising in linear logic, complexity theory, and set theory
• Joint spreading models and uniform approximation of bounded operators
• A note on induced Turán numbers
• New bounds on the Ramsey number r(I_m, L_n)
• Higher Order Spreading Models
• Is Ramsey's theorem omega-automatic?
• Tree independence number III. Thetas, prisms and stars
• On the sum of k-th largest distance eigenvalues of graphs
• Degeneracy of P_t-free and C_{≥ t}-free graphs with no large complete bipartite subgraphs
• On asymptotic models in Banach spaces
• New Lower Bound Formulas for Multicolored Ramsey Numbers
• Ramsey Theory for Words Representing Rationals
• Dichotomizing k-vertex-critical H-free graphs for H of order four
• The morphology of infinite tournaments. Application to the growth of their profile
• Typical T-free graphs
• The multicolour size-Ramsey number of powers of paths
• Stars versus stripes Ramsey numbers
• Embedding degenerate graphs of small bandwidth
• Hindman's finite sums theorem and its application to topologizations of\n algebras
• Edges not in any monochromatic copy of a fixed graph
• k-Critical Graphs in P₅-Free Graphs
• Ramsey multiplicity for ordered graphs
• Uniform Turán density -- palette classification
• Three Proofs of the Hypergraph Ramsey Theorem (An exposition)
• Homology multipliers and the relation type of parameter ideals
• New upper bound for multicolor Ramsey numbers
• Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic
• Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns
• Treewidth versus clique number. V. Further connections with tree-independence number
• Infinite paths and cliques in random graphs
• A Coloring Algorithm for 4K₁-free line graphs
• Turán and Ramsey problems for alternating multilinear maps
• Ramsey Theory for Words over an Infinite Alphabet
• On the Zarankiewicz problem for graphs with bounded VC-dimension
• Approximate Euclidean Ramsey theorems
• Local rainbow colorings of hypergraphs
• A Ramsey space of infinite polyhedra and the random polyhedron
• What is Ramsey-equivalent to a clique?
• The Power of Matching for Online Fractional Hedonic Games
• Two-player nonZero–sum stopping games in discrete time
• On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness
• Monochromatic bounded degree subgraph partitions
• A Ramsey theorem for trees
• A partition theorem for the infinite subtrees of a tree
• A partition theorem
• Ramsey with purple edges
• On forbidden induced subgraphs for K_1,3-free perfect graphs
• Constructible Words Characterize Rational Languages of Words Indexed by Scattered Linear Orderings
• Separateness of Variables -- A Novel Perspective on Decidable First-Order Fragments
• From well-quasi-ordered sets to better-quasi-ordered sets
• Unsolved problems in visibility graphs of points, segments, and polygons
• What Can be Computed Locally?
• The Erdos-Szekeres problem on points in convex position – a survey
• Ultraproducts which are not saturated
• A proof of a sumset conjecture of Erdős
• Ramsey numbers of degenerate graphs
• A dual method of constructing hereditarily indecomposable Banach spaces
• Succinct definitions in the first order theory of graphs
• A method in graph theory
• Small Ramsey Numbers
• A note on induced Ramsey numbers
• A. W. Goodman: research mathematician and educator
• Induced Ramsey-type theorems
• On two problems in graph Ramsey theory
• A new upper bound for diagonal Ramsey numbers
• Density theorems for bipartite graphs and related Ramsey-type results
• Extremal results in sparse pseudorandom graphs
• The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
• On the necessary use of abstract set theory
• Kernelization: Theory of Parameterized Preprocessing
• Knots and links in spatial graphs: A survey
• The origins of combinatorics on words
• On graphs with a simple structure of maximal cliques
• 3‐Color bipartite Ramsey number of cycles and paths
• Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
• Multicolour Ramsey numbers of paths and even cycles
• Ramsey Numbers of Interval 2-Chromatic Ordered Graphs
• A partition calculus in set theory
• On a Generalization of Spikes
• Phase transitions of the Erdős-Gyárfás function
• Ramsey's theorem [wikipedia]
• ‘Action-Reaction’ Hypothesis in Economics [europepmc]