ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C2k+1\mathcal{C}_{2k+1} denote the family consisting of the cycle C2k+1C_{2k+1}, and let satg(C2k+1;n)\mathrm{sat}_g(\mathcal{C}_{2k+1};n) be the corresponding saturation-game value on nn vertices. Consecutive odd-cycle saturation-game monotonicity conjecture. For all k≥2k\ge 2,

satg(C2k−1;n)≤satg(C2k+1;n)\mathrm{sat}_g(\mathcal{C}_{2k-1};n)\le \mathrm{sat}_g(\mathcal{C}_{2k+1};n)

for nn sufficiently large. The conjecture strengthens the comparison known in the source when the index gap is sufficiently large, asserting monotonicity for consecutive odd cycles. No resolution is given.

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.