On a Problem of Formal Logic
1930/01/01 by F. P. Ramsey, Frank Plumpton Ramsey · 101 citations
Mathematics · Computer Science · #Advanced Topology and Set Theory #Advanced Algebra and Logic #Computability, Logic, AI Algorithms
paper · doi:10.1112/plms/s2-30.1.264
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 Kt,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
- Tree Independence Number III. Thetas, Prisms and Stars
- 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 PSc0
- 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 x1 + x2 + … + xk = x0
- 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 Rd
- 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 P5
- (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\n 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\n uniform looseness
- 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\n Distribution
- Control Closure Certificates
- Obstructions for three-coloring and list three-coloring H-free graphs
- 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
- 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\n Matrices
- Erdős-Rado Classes
- A characterization of Fibonacci numbers