ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture. In particular this machinery was key in their proof of the best current bound for the general version of the problem. Typically a graph will have many Mozhan partitions, and the method involves a scheme called a move sequence for exploring the set of all such partitions to find one that is particularly favourable. While we use this same basic approach in our proof, our choice of move sequence is quite different from that used by Cranston and Rabern in [7], and in particular provides a simpler proof of their result as well as the generalization given by Theorem 1. We remark that the specific case t “ 1 was addressed in [17] using an argument parallel to that of [7], and gave a lower bound of ∆pGq ´ 17 on the clique size. The report passage is retained verbatim as the relevant context for this extracted problem.

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.