New results on cyclic and ordered Ramsey numbers
Gaurav Kucheriya, Jan Petr, Jun Yan
Abstract
Inspired by the work of Poljak, Bašić, Damnjanović, Stevanović, and Stošić used the Kissat SAT solver in a recent paper to systematically determine the small cyclic and ordered Ramsey numbers of several families of graphs. By studying the patterns in their data, Bašić et al. formulated 15 conjectures on cyclic and ordered Ramsey numbers. In this paper, we confirm 9 of their conjectures, trace confirmations of 2 more to existing literature, and, perhaps surprisingly, disprove another one.
Create a lesson
Related papers
Tusnády's problem and online two-sample thinning
Yuhao Lei
An improved minimum degree threshold for fractional clique decompositions in partite graphs
Sean Longbrake, Michael Simkin, Liana Yepremyan et al.
Fourier level inequalities on the discrete cube via complex hypercontractivity and Riesz transforms
Fan Chang, Zhenyu Li, Guanghui Wang et al.
Some polynomial spaces are Euclidean balls
Yuxian Dong, Wenle Shi
Open Problems on the Null Space and Image Space of the Adjacency Matrix
K Kranthi Priya, K C Sivakumar
The probabilistic bound for perfect hashing is sharp only for binary alphabets
Shitao Li, Minjia Shi