Non-isomorphism conjecture for proper minor- and union-closed families
Non-isomorphism conjecture for proper minor- and union-closed families
Let be a minor- and union-closed family of graphs, and let denote homomorphism indistinguishability over . Non-isomorphism conjecture. If does not contain all graphs, then is not the isomorphism relation. This is presented as a relaxation of the main distinctness conjecture. The paper notes that union-closure is unnecessary for a proper minor-closed class after closing under disjoint unions, and leaves the assertion open.
Sources & referencesView supporting material
Primary source
David E. Roberson, “Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree”, arXiv:2206.10321 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.