Computational lower limits on small Ramsey numbers

2015/05/27 by Kuznetsov, Eugene
#Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1505.07186

Abstract

Computer-based attempts to construct lower bounds for small Ramsey numbers are discussed. A systematic review of cyclic Ramsey graphs is attempted. Many known lower bounds are reproduced. Several new bounds are reported.

Related

• New lower bounds for two color and multicolor Ramsey numbers
• A Lower Bound for R(5,6)
• Reinforcement learning for graph theory, II. Small Ramsey numbers
• Study of Exoo's Lower Bound for Ramsey number R(5,5)
• Small Ramsey numbers for books, wheels, and generalizations