ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C\mathfrak{C} be the set of all pairs of non-empty sets of cycles, and let R(\Ga1,\Ga2)R(\Ga_1,\Ga_2) be the corresponding generalised Ramsey number. For (\Ga1,\Ga2)∈C(\Ga_1,\Ga_2)\in\mathfrak{C}, let m(\Ga1,\Ga2)\mathfrak{m}(\Ga_1,\Ga_2) be the number defined by

m(\Ga1,\Ga2)=max⁡ ⁣(5,min⁡(\ga2+\gae1/2−1,2\ga2−1),min⁡(\ga1+\gae2/2−1,2\ga1−1)).\mathfrak{m}(\Ga_1,\Ga_2)=\max\!\big(5,\min(\ga^2+\ga_e^1/2-1,2\ga^2-1),\min(\ga^1+\ga_e^2/2-1,2\ga^1-1)\big).

Theorem~ gives the lower bound R(\Ga1,\Ga2)≥m(\Ga1,\Ga2)R(\Ga_1,\Ga_2)\geq \mathfrak{m}(\Ga_1,\Ga_2), with the stronger bound R(\Ga1,\Ga2)≥m(\Ga1,\Ga2)+1R(\Ga_1,\Ga_2)\geq \mathfrak{m}(\Ga_1,\Ga_2)+1 for the exceptional class specified there. Equality conjecture. Equality holds in the lower bound of Theorem~ for all pairs (\Ga1,\Ga2)∈C(\Ga_1,\Ga_2)\in\mathfrak{C}.

The conjecture extends the cases established in the theorem, including all pairs for which min⁡(\Ga1∪\Ga2)≤6\min(\Ga_1\cup\Ga_2)\leq 6 and the specified classes C1∪C2\mathfrak{C}_1\cup\mathfrak{C}_2, as well as the special case where both shortest-cycle lengths are even. Determining whether equality always holds remains open in the source.

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.