The Sierpiński product automorphism conjecture for 2-connected graphs
The Sierpiński product automorphism conjecture for 2-connected graphs
Let and be -connected graphs, and let be any mapping. The group and the automorphism group of the Sierpiński product are defined by the notation in the source. Sierpiński product automorphism conjecture. Then
The conjecture proposes that every automorphism of the Sierpiński product of two -connected graphs respects the fundamental edge partition. It is motivated by the absence of counterexamples in the -connected case; the source does not provide a resolution.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Jurij Kovič, Tomaž Pisanski, Sara Sabrina Zemljič and Arjana Žitnik, “The Sierpiński product of graphs”, arXiv:1904.04180 (2019).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.