ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PnP_n be the path on nn vertices, let FF be a non-empty linear forest on mm vertices, let K1∨FK_1\vee F denote the join of FF with a single vertex, and let o(F)o(F) be the number of odd-order components of FF. Path–linear-forest quasar Ramsey conjecture. If

n≥2andn+1≤m≤2n−1,n\geq 2\quad\text{and}\quad n+1\leq m\leq 2n-1,

then

R(Pn,K1∨F)=max⁡{2n−1,⌈3m2⌉−1,m+n−o(F)−2}.R(P_n,K_1\vee F)=\max\left\{2n-1,\left\lceil\frac{3m}{2}\right\rceil-1, m+n-o(F)-2\right\}.

This would determine the remaining Ramsey numbers of paths versus proper quasars of the form K1∨FK_1\vee F in the range n+1≤m≤2n−1n+1\leq m\leq 2n-1; the preceding results establish matching bounds when every component of FF has even order, but the general case is left open.

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.