Skip to search formSkip to main contentSkip to account menu

Ramsey's theorem

Known as: R(5, 5), Ramsey number, Ramsey theorem 
In combinatorial mathematics, Ramsey's theorem states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Binary logarithmBrute-force searchClique (graph theory)Distributed computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
On The Restricted Size Ramsey Number
2015
2015
Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three
Let $P$ denote a 3-uniform hypergraph consisting of 7 vertices $a,b,c,d,e,f,g$ and 3 edges $\{a,b,c\}, \{c,d,e\},$ and $\{e,f,g… 
2007
2007
A Ramsey theorem for polyadic spaces
A polyadic space is a Hausdorff continuous image of some power of the onepoint compactification of a discrete space. We prove a… 
2006
2006
The Ramsey numbers of large cycles versus wheels
2004
2004
Bipartite anti-Ramsey numbers of cycles
We determine the maximum number of colors in a coloring of the edges of Km,n such that every cycle of length 2k contains at least… 
1997
1997
Ramsey Numbers For Cocircuits In Matroids
1996
1996
A conjecture of Goodman and the multiplicities of graphs
We prove a about the maximum number of monochromatic VLJ. • kU"."OVU T,WO-(;OllC)nng of the of Kn with fixed number of Moreover… 
1995
1995
A Ramsey theorem in Boyer-Moore logic
We use the Boyer-Moore Prover, Nqthm, to verify the Paris-Harrington version of Ramsey's theorem. The proof we verify is a… 
1992
1992
A Canonical Ramsey Theorem
Say a graph H selects a graph G if given any coloring of H, there will be a monochromatic induced copy of G in H or a completely… 
1952
1952
Cores of Terrestrial Planets
ONE feature of Prof. H. C. Urey's new theory1 of the development of the planets is that it leads him to conclude on several… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)