ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The anti-Ramsey number AR(n,G)\mathrm{AR}(n,G) is the maximum possible number of colours in which the edges of KnK_n can be coloured without creating a rainbow copy of GG (i.e. one in which all edges have different colours). Let CkC_k be the cycle on kk vertices. Is it true that AR(n,Ck)=(k−22+1k−1)n+O(1)?\mathrm{AR}(n,C_k)=\left(\frac{k-2}{2}+\frac{1}{k-1}\right)n+O(1)? Let PkP_k be the path on kk vertices and ℓ=⌊k−12⌋\ell=\lfloor\frac{k-1}{2}\rfloor. If n≥k≥5n\geq k\geq 5 then is AR(n,Pk)\mathrm{AR}(n,P_k) equal to max⁡((k−22)+1,(ℓ−12)+(ℓ−1)(n−ℓ+1)+ϵ)\max\left(\binom{k-2}{2}+1, \binom{\ell-1}{2}+(\ell-1)(n-\ell+1)+\epsilon\right) where ϵ=1\epsilon=1 if kk is odd and ϵ=2\epsilon=2 otherwise?

Record

Added
Links

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.