ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a graph be (anti)palindromic if it has the palindromic or antipalindromic symmetry defined in the paper, and let its order be its number of vertices. Order divisibility conjecture. Every (anti)palindromic graph has order multiple of four (plus two). By the preceding corollary, the claim is proved for (anti)palindromic trees; the authors report computer searches suggesting that it holds for any graph, but no general proof is given.

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.