Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,822,653 papers from all fields of science
Search
Sign In
Create Free Account
Ramsey's theorem
Known as:
R(5, 5)
, Ramsey number
, Ramsey theorem
Expand
In combinatorial mathematics, Ramsey's theorem states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Binary logarithm
Brute-force search
Clique (graph theory)
Distributed computing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Experimental determination of Ramsey numbers with quantum annealing
Zhengbing Bian
,
F. Chudak
,
W. Macready
,
L. Clark
,
F. Gaitan
2012
Corpus ID: 118082951
Ramsey theory is a highly active research area in mathematics that studies the emergence of order in large disordered structures…
Expand
2010
2010
Another Abstraction of the Erdös-Szekeres Happy End Theorem
N. Alon
,
E. Chiniforooshan
,
V. Chvátal
,
François Genest
Electronic Journal of Combinatorics
2010
Corpus ID: 5222698
The Happy End Theorem of Erdős and Szekeres asserts that for every integer $n$ greater than two there is an integer $N$ such that…
Expand
2010
2010
An Anti-Ramsey Theorem on Diamonds
Juan José Montellano-Ballesteros
Graphs Comb.
2010
Corpus ID: 34961868
AbstractLet G be the diamond (the graph obtained from K4 by deleting an edge) and, for every n ≥ 4, let f(n, G) be the minimum…
Expand
2005
2005
Planar Ramsey Numbers for Small Graphs
A. Dudek
,
A. Rucinski
2005
Corpus ID: 7398666
Given two graphs G1 and G2, the planar Ramsey number PR(G1, G2) is the smallest integer n such that every planar graph on n…
Expand
2005
2005
Computation of the Ramsey Number R(W5,K5)
Joshua Stinehour
,
S. Radziszowski
,
Kung-Kuen Tse
arXiv.org
2005
Corpus ID: 12217981
We determine the value of the Ramsey number R(W5, K5) to be 27, where W5 = K1 + C4 is the 4-spoked wheel of order 5. This solves…
Expand
2001
2001
Edge Coloration of Complete Graph K_(97) and New Lower Bounds of Four Ramsey Numbers
Hai-Peng Luo
2001
Corpus ID: 123990270
A constructive method is employed to study all kinds of edge coloration of complete graph K97, thus the new lower bounds of four…
Expand
2000
2000
Ramsey Numbers r(C5, G) for all Graphs G of Order Six
C. Jayawardene
,
C. Rousseau
Ars Comb.
2000
Corpus ID: 8313817
1997
1997
Ramsey Numbers For Cocircuits In Matroids
Fair Barbour Hurst
,
T. J. Reid
Ars Comb.
1997
Corpus ID: 11861328
1992
1992
An Example in Nqthm: Ramsey's Theorem
Matt Kaufmann
1992
Corpus ID: 14011580
We present here a proof of Ramsey's Theorem for exponent 2 using the Boyer-Moore theorem prover. The presentation is intended to…
Expand
1981
1981
A note on constructive methods for ramsey numbers
Chung Fan
1981
Corpus ID: 120758453
Let r(k) denote the least integer n-such that for any graph G on n vertices either G or its complement G contains a complete…
Expand