The order divisibility conjecture for (anti)palindromic graphs
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.