English

Oddomorphisms, Split-Off Minors, and the Strong Roberson Conjecture

Discrete Mathematics 2026-07-03 v1 Logic in Computer Science Combinatorics

Abstract

We show that the existence of an oddomorphism from a graph FF to a graph GG does not imply that GG is a minor of FF. This answers a question posed by Roberson (2022) and shows that the CFI graphs cannot be used to prove the Strong Roberson Conjecture. Additionally, we introduce the concept of a split-off minor and show that the existence of an oddomorphism from FF to GG implies that GG is a split-off minor of FF. Consequently, every class that is closed under taking split-off minors and disjoint unions is homomorphism distinguishing closed. The split-off minor relation is the first minor-like structural relation shown to have this property, marking a meaningful advancement in our understanding of the interaction between structural graph containment and homomorphism indistinguishability relations.

Cite

@article{arxiv.2607.03405,
  title  = {Oddomorphisms, Split-Off Minors, and the Strong Roberson Conjecture},
  author = {Arnar Á. Kristjánsson},
  journal= {arXiv preprint arXiv:2607.03405},
  year   = {2026}
}

Comments

22 pages