Positive matching decomposition conjecture for Cartesian products of cycles

From papers

Let CmC_m and CnC_n be cycles with m,n3m,n\geq3, and let pmd(G)\mathrm{pmd}(G) denote the positive matching decomposition number. Positive matching decomposition conjecture for Cartesian products of cycles.

pmd(CmCn)=6\mathrm{pmd}(C_m\square C_n)=6

for all m,n3m,n\geq3 such that m+nm+n is even, or such that (m,n){(3,4),(3,6),(5,6)}(m,n)\in\{(3,4),(3,6),(5,6)\}. 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.

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

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.

Solutions 0

No solutions have been posted yet.