ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nK2nK_2 be a matching with nn edges, and let C4C_4 be the cycle on four vertices. For graphs GG, write G→(nK2,C4)G\to (nK_2,C_4) when every red-blue edge-colouring of GG contains either a red copy of nK2nK_2 or a blue copy of C4C_4, and let r^c(nK2,C4)\hat r_c(nK_2,C_4) denote the minimum number of edges in a connected graph GG with this property.

Connected size Ramsey conjecture. For all positive integers nn,

r^c(nK2,C4)=⌊9n−12⌋.\hat r_c(nK_2,C_4)=\left\lfloor\frac{9n-1}{2}\right\rfloor.

The paper proves the matching upper bound for every positive integer nn by constructing connected graphs with the stated number of edges. The conjecture asserts that this upper bound is tight for all nn.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.