“…Conlon [
7] proved that
, which confirms a conjecture of Thomason [
25] asymptotically and also gives an answer to a problem proposed by Erdős [
9]. Using a different method, the upper bound has been improved to
by Conlon, Fox and Wigderson [
8]. For more Ramsey numbers of large books versus other graphs, we refer the reader to [
12,13,15,18,23] and other related references.…”