ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TGrm,n\text{TGr}_{m,n} be the toroidal grid graph formed from the Cartesian product of the cycle graphs CmC_m and CnC_n, with m,n≥3m,n\geq 3, and let R(G)\mathcal{R}(G) denote the representation number of a graph GG. Representation-number conjecture. If n,m≥3n,m\geq 3 and m+n≥8m+n\geq 8, then

R(TGrm,n)≥4.\mathcal{R}(\text{TGr}_{m,n})\geq 4.

The graphs TGr3,3\text{TGr}_{3,3} and TGr3,4\text{TGr}_{3,4} have known 3-representations, but no 3-representation is known for larger toroidal grid graphs; the conjecture predicts that all cases with m+n≥8m+n\geq 8 require representation number at least 44.

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.