Connected size Ramsey number conjecture for matchings versus C_4
Statement
Let be a matching with edges, and let be the cycle on four vertices. For graphs , write when every red-blue edge-colouring of contains either a red copy of or a blue copy of , and let denote the minimum number of edges in a connected graph with this property.
Connected size Ramsey conjecture. For all positive integers ,
The paper proves the matching upper bound for every positive integer by constructing connected graphs with the stated number of edges. The conjecture asserts that this upper bound is tight for all .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.