ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Rm,nR_{m,n} denote the checkerboard graph whose vertices are the squares of an m×nm\times n checkerboard, with adjacency determined by the graph construction above. A graph derangement is a permutation of the vertices induced by an automorphism-free cycle decomposition into graph cycles; a graph is even universal if it admits a graph derangement of every even cycle type of the appropriate size. Laison's conjecture. There is a positive integer N0N_0 such that for all k,l≥N0k,l\geq N_0, the checkerboard graph R2k,2lR_{2k,2l} is even universal. This predicts that sufficiently large checkerboard graphs with both side lengths even admit graph derangements of every even cycle type, despite the excluded cycle types known for some smaller or differently shaped graphs.

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.