Positive matching decomposition conjecture for Cartesian products of cycles
Let and be cycles with , and let denote the positive matching decomposition number. Positive matching decomposition conjecture for Cartesian products of cycles.
for all such that is even, or such that . The supplied text presents this exact-value assertion after an analysis of positive matchings in the relevant Cartesian products; no resolution beyond that analysis is provided.
References
Primary source
Mohammad Farrokhi Derakhshandeh Ghouchan and Ali Akbar Yazdan Pour, “Positive matching decompositions of the cartesian product of graphs”, arXiv:2502.02826 (2025).
Additional references
3 papers in this index state this conjecture (2022–2025). The statement above is taken from the most recent of them; the others are arXiv:2405.20480, arXiv:2202.10463.
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
No solutions have been posted yet.