Fetching the paper…
Reading the bibliography…
Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs.
On a Problem of Formal Logic
F. P. Ramsey · 1930
Earlier work this paper cites.
On the representation of directed graphs as unions of orderings
P. Erdős and L. Moser · 1964
Earlier work this paper cites.
On Ramsey numbers for books
C. C. Rousseau and J. Sheehan · 1978
Earlier work this paper cites.
Ramsey numbers of hypergraphs
G. Exoo · 1987
Earlier work this paper cites.
The Ramsey number of K 5 − e K_{5}-e
C. Clapham, G. Exoo, H. Harborth, I. Mengersen, and J. Sheehan · 1989
Earlier work this paper cites.
Three color Ramsey number of K 4 − e K_{4}-e
G. Exoo · 1991
Earlier work this paper cites.
A new upper bound for R 3 ( K 4 − e ) R_{3}(K_{4}-e)
K. Piwakowski · 1997
Earlier work this paper cites.
New upper bounds for Ramsey numbers
Y. R. Huang and K. M. Zhang · 1998
Earlier work this paper cites.
On tournaments free of large transitive subtournaments
A. Sánchez-Flores · 1998
Earlier work this paper cites.
CSDP, A C library for semidefinite programming
B. Borchers · 1999
Earlier work this paper cites.
New lower bounds for table iii
G. Exoo · 2000
Earlier work this paper cites.
Bounds on Ramsey numbers of certain complete bipartite graphs
R. Lortz and I. Mengersen · 2002
Earlier work this paper cites.
Distance Ramsey numbers
H. Harborth and S. Krause · 2006
Earlier work this paper cites.
Further Ramsey numbers for small complete bipartite graphs
R. Lortz and I. Mengersen · 2006
Earlier work this paper cites.
Flag algebras
A. A. Razborov · 2007
Earlier work this paper cites.
A note on some Ramsey numbers R ( C p , C q , C r ) R(C_{p},C_{q},C_{r})
K.-K. Tse · 2007
Earlier work this paper cites.
Cycle-complete graph Ramsey numbers r ( C 4 , K 9 ) , r ( C 5 , K 8 ) ≤ 33 r(C_{4},K_{9}),r(C_{5},K_{8})\leq 33
M. M. M. Jaradat and B. M. N. Alzaleq · 2009
Cited alongside, same era.
The multi-color Ramsey number of an odd cycle
Y. Li · 2009
Cited alongside, same era.
Lower bounds for Ramsey numbers based on simulated annealing algorithm (in Chinese)
Z. Shao, Z. Wang, and J. Xiao · 2009
Cited alongside, same era.
Bounds on some Ramsey numbers involving quadrilateral
X. Xu, Z. Shao, and S. P. Radziszowski · 2009
Cited alongside, same era.
Computation of some generalized Ramsey numbers
Z. Shao, J. Xu, Q. Bao, and L. Pan · 2010
Cited alongside, same era.
A high-performance software package for semidefinite programs: SDPA 7, 2010
On the number of pentagons in triangle-free graphs
H. Hatami, J. Hladký, D. Kráľ, S. Norine, and A. Razborov · 2013
Later among the works it cites.
Sobre los números de Ramsey R ( K 5 − e , K 5 ) R(K_{5}-e,K_{5}) y R ( K 6 − e , K 4 ) R(K_{6}-e,K_{4}) , 2014
L. Boza · 2014
Later among the works it cites.
Minimum number of monotone subsequences of length 4 in permutations
J. Balogh, P. Hu, B. Lidický, O. Pikhurko, B. Udvari, and J. Volec · 2015
Later among the works it cites.
The codegree threshold for 3-graphs with independent neighborhoods
V. Falgas-Ravry, E. Marchant, O. Pikhurko, and E. R. Vaughan · 2015
Later among the works it cites.
Finitely forcible graphons and permutons
R. Glebov, A. Grzesik, T. Klimošová, and D. Král’ · 2015
Later among the works it cites.
Limits of order types
X. Goaoc, A. Hubard, R. de Joannis de Verclos, J.-S. Sereni, and J. Volec · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Yamashita, K. Fujisawa, K. Nakata, M. Nakata, M. Fukuda, K. Kobayashi, and K. Goto · 2010
Cited alongside, same era.
Hypergraphs do jump
R. Baber and J. Talbot · 2011
Cited alongside, same era.
On some Ramsey numbers for quadrilaterals
J. Dybizbański and T. Dzido · 2011
Cited alongside, same era.
Personal communication
L. Boza · 2012
Cited alongside, same era.
Three color Ramsey numbers for graphs with at most 4 vertices
L. Boza, J. Dybizbański, and T. Dzido · 2012
Cited alongside, same era.
Sobre el Número de Ramsey R ( K 4 − e , K 7 ) R(K_{4}-e,K_{7})
L. Boza and J. Portillo · 2012
Cited alongside, same era.
On some multicolor Ramsey numbers involving K 3 + e K_{3}+e and K 4 − e K_{4}-e
D. S. Shetler, M. A. Wurtz, and S. P. Radziszowski · 2012
Cited alongside, same era.
Later among the works it cites.
On the maximum quartet distance between phylogenetic trees
N. Alon, H. Naves, and B. Sudakov · 2016
Later among the works it cites.
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
J. Balogh, P. Hu, B. Lidický, and F. Pfender · 2016
Later among the works it cites.
A problem of Erdős and Sós on 3-graphs
R. Glebov, D. Král’, and J. Volec · 2016
Later among the works it cites.
New upper bounds for Ramsey number R ( K m − e , K n − e ) R(K_{m}-e,K_{n}-e) , 2016
Y. Huang, F. Tan, J. Huang, and K. Zhang · 2016
Later among the works it cites.
The clique density theorem
C. Reiher · 2016
Later among the works it cites.
Crossing numbers of complete tripartite and balanced complete multipartite graphs
E. Gethner, L. Hogben, B. Lidický, F. Pfender, A. Ruiz, and M. Young · 2017
Closest in time.
Small Ramsey numbers
S. P. Radziszowski · 2017
Closest in time.
Pentagons in triangle-free graphs
B. Lidický and F. Pfender · 2018
Closest in time.
The pentagon is almost a fractalizer, 2020
B. Lidický, C. Mattes, and F. Pfender · 2020
Closest in time.
Algorithms for computing ramsey numbers, 2020
S. V. Overberghe · 2020
Closest in time.