Faudree–Rousseau–Sheehan's strongly regular graph conjecture
Faudree–Rousseau–Sheehan's strongly regular graph conjecture
A strongly regular graph is a graph of order that is -regular, with every adjacent pair having common neighbors and every nonadjacent pair having common neighbors. Define
Faudree–Rousseau–Sheehan's conjecture. There exists a constant such that for every strongly regular graph ,
The paper says this conjecture is closely related to the linear upper-bound conjecture for book Ramsey numbers and places it in the context of strongly regular graphs, which provide lower bounds for related Ramsey numbers. No resolution is given in the supplied source.
Sources & referencesView supporting material
Primary source
Xun Chen, Qizhong Lin and Chunlin You, “Ramsey numbers of large books”, arXiv:2103.05814 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.