Answers are grounded in this paper and cite their sources.
A graph is bisectable if its vertex set can be split into two sets inducing isomorphic subgraphs. Ando conjectured that every cubic graph is bisectable, and Das, Pokrovskiy, and Sudakov proved it for large enough connected cubic graphs. We give a constructive proof that, for every d≥5, there exists a non-bisectable d-regular graph of even order.
No takes yet. Share an insight, caveat, or question.
Elie Feinsilber (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: