Distinguishing conjecture for distinct immersion-closed classes
Let and be two distinct immersion-closed and union-closed graph classes. For graphs and , write when for every . Distinguishing conjecture. There exist with and graphs and such that
This would strengthen the paper's homomorphism-counting results by showing that distinct immersion-closed, union-closed classes induce genuinely different equivalence relations. The source presents it as an open problem, and no resolution is specified.
References
- Andrea Jiménez, Benjamin Moore, Daniel A. Quiroz and Youngho Yoo, “Homomorphism counting for immersion-closed classes is not isomorphism”, arXiv:2602.08738 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.